./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:12:03,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:12:03,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:12:03,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:12:03,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:12:03,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:12:03,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:12:03,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:12:03,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:12:03,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:12:03,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:12:03,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:12:03,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:12:03,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:12:03,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:12:03,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:12:03,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:12:03,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:12:03,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:12:03,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:12:03,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:12:03,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:12:03,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:12:03,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:12:03,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:12:03,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:12:03,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:12:03,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:12:03,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:12:03,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:12:03,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:12:03,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:12:03,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:12:03,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:12:03,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:12:03,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:12:03,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:12:03,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:12:03,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:12:03,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:12:03,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:12:03,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:12:04,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:12:04,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:12:04,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:12:04,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:12:04,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:12:04,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:12:04,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:12:04,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:12:04,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:12:04,030 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:12:04,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:12:04,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:12:04,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:12:04,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:12:04,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:12:04,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:12:04,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:12:04,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:12:04,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:12:04,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:12:04,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:12:04,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:12:04,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:12:04,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:12:04,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:12:04,034 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2022-07-21 17:12:04,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:12:04,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:12:04,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:12:04,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:12:04,300 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:12:04,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-21 17:12:04,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4260e6/88ced8c8e29d480398f7b6302c5b6ded/FLAG28c3e4b67 [2022-07-21 17:12:04,771 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:12:04,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-21 17:12:04,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4260e6/88ced8c8e29d480398f7b6302c5b6ded/FLAG28c3e4b67 [2022-07-21 17:12:04,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4260e6/88ced8c8e29d480398f7b6302c5b6ded [2022-07-21 17:12:04,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:12:04,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:12:04,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:12:04,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:12:04,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:12:04,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:12:04" (1/1) ... [2022-07-21 17:12:04,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b787b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:04, skipping insertion in model container [2022-07-21 17:12:04,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:12:04" (1/1) ... [2022-07-21 17:12:04,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:12:04,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:12:05,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:12:05,128 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:12:05,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:12:05,190 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:12:05,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05 WrapperNode [2022-07-21 17:12:05,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:12:05,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:12:05,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:12:05,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:12:05,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,227 INFO L137 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2022-07-21 17:12:05,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:12:05,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:12:05,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:12:05,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:12:05,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:12:05,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:12:05,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:12:05,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:12:05,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (1/1) ... [2022-07-21 17:12:05,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:12:05,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:05,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 17:12:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:12:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:12:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:12:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:12:05,386 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:12:05,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:12:05,713 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:12:05,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:12:05,718 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 17:12:05,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:12:05 BoogieIcfgContainer [2022-07-21 17:12:05,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:12:05,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:12:05,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:12:05,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:12:05,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:12:04" (1/3) ... [2022-07-21 17:12:05,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddc8bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:12:05, skipping insertion in model container [2022-07-21 17:12:05,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:12:05" (2/3) ... [2022-07-21 17:12:05,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddc8bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:12:05, skipping insertion in model container [2022-07-21 17:12:05,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:12:05" (3/3) ... [2022-07-21 17:12:05,723 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2022-07-21 17:12:05,732 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:12:05,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-07-21 17:12:05,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:12:05,766 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@40f1999d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@490a5fb7 [2022-07-21 17:12:05,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-07-21 17:12:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 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-21 17:12:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:12:05,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:05,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:12:05,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:12:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697131684] [2022-07-21 17:12:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:05,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697131684] [2022-07-21 17:12:05,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697131684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:05,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:12:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114855200] [2022-07-21 17:12:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:05,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:05,929 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,049 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2022-07-21 17:12:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:12:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,057 INFO L225 Difference]: With dead ends: 166 [2022-07-21 17:12:06,057 INFO L226 Difference]: Without dead ends: 162 [2022-07-21 17:12:06,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,060 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-21 17:12:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2022-07-21 17:12:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 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-21 17:12:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-07-21 17:12:06,087 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2022-07-21 17:12:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,087 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-07-21 17:12:06,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-07-21 17:12:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:12:06,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:12:06,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:12:06,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:12:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165541842] [2022-07-21 17:12:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165541842] [2022-07-21 17:12:06,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165541842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:12:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358062486] [2022-07-21 17:12:06,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,153 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,257 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2022-07-21 17:12:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:12:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,260 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:12:06,260 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:12:06,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,261 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:12:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2022-07-21 17:12:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-07-21 17:12:06,270 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2022-07-21 17:12:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,271 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-07-21 17:12:06,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-07-21 17:12:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:12:06,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:12:06,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2022-07-21 17:12:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389010434] [2022-07-21 17:12:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389010434] [2022-07-21 17:12:06,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389010434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757561574] [2022-07-21 17:12:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:12:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:12:06,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:12:06,337 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,503 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-07-21 17:12:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:12:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:12:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,506 INFO L225 Difference]: With dead ends: 146 [2022-07-21 17:12:06,507 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 17:12:06,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:06,514 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:12:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 17:12:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2022-07-21 17:12:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-07-21 17:12:06,521 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2022-07-21 17:12:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,521 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-07-21 17:12:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-07-21 17:12:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:12:06,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:12:06,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2022-07-21 17:12:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442277487] [2022-07-21 17:12:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442277487] [2022-07-21 17:12:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442277487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56838810] [2022-07-21 17:12:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:12:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:12:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:12:06,574 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,740 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2022-07-21 17:12:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:12:06,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 17:12:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,742 INFO L225 Difference]: With dead ends: 227 [2022-07-21 17:12:06,742 INFO L226 Difference]: Without dead ends: 227 [2022-07-21 17:12:06,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:06,743 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:12:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-21 17:12:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2022-07-21 17:12:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2022-07-21 17:12:06,752 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2022-07-21 17:12:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,752 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2022-07-21 17:12:06,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2022-07-21 17:12:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:12:06,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:12:06,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2022-07-21 17:12:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696922969] [2022-07-21 17:12:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696922969] [2022-07-21 17:12:06,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696922969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488311622] [2022-07-21 17:12:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,791 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-21 17:12:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,804 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2022-07-21 17:12:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-21 17:12:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,808 INFO L225 Difference]: With dead ends: 186 [2022-07-21 17:12:06,808 INFO L226 Difference]: Without dead ends: 186 [2022-07-21 17:12:06,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,809 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:12:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-21 17:12:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2022-07-21 17:12:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2022-07-21 17:12:06,815 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2022-07-21 17:12:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,816 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2022-07-21 17:12:06,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-21 17:12:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-07-21 17:12:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:12:06,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:12:06,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2022-07-21 17:12:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415747600] [2022-07-21 17:12:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415747600] [2022-07-21 17:12:06,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415747600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300716253] [2022-07-21 17:12:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,845 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,852 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2022-07-21 17:12:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-21 17:12:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,853 INFO L225 Difference]: With dead ends: 175 [2022-07-21 17:12:06,853 INFO L226 Difference]: Without dead ends: 175 [2022-07-21 17:12:06,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,854 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:12:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-21 17:12:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-21 17:12:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2022-07-21 17:12:06,860 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2022-07-21 17:12:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,860 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2022-07-21 17:12:06,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2022-07-21 17:12:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:12:06,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:12:06,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2022-07-21 17:12:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592290315] [2022-07-21 17:12:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592290315] [2022-07-21 17:12:06,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592290315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528496656] [2022-07-21 17:12:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,887 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,893 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2022-07-21 17:12:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-21 17:12:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,894 INFO L225 Difference]: With dead ends: 177 [2022-07-21 17:12:06,894 INFO L226 Difference]: Without dead ends: 177 [2022-07-21 17:12:06,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,895 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:12:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-21 17:12:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-21 17:12:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2022-07-21 17:12:06,900 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2022-07-21 17:12:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,900 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2022-07-21 17:12:06,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2022-07-21 17:12:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:12:06,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:12:06,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2022-07-21 17:12:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924792896] [2022-07-21 17:12:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:06,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924792896] [2022-07-21 17:12:06,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924792896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:06,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:06,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870932520] [2022-07-21 17:12:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:06,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,933 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:06,945 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-07-21 17:12:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:12:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:06,946 INFO L225 Difference]: With dead ends: 192 [2022-07-21 17:12:06,946 INFO L226 Difference]: Without dead ends: 192 [2022-07-21 17:12:06,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:06,947 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:06,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:12:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-21 17:12:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2022-07-21 17:12:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2022-07-21 17:12:06,956 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2022-07-21 17:12:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:06,956 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2022-07-21 17:12:06,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2022-07-21 17:12:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:12:06,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:06,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:06,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:12:06,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:06,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2022-07-21 17:12:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:06,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300323366] [2022-07-21 17:12:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300323366] [2022-07-21 17:12:07,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300323366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:12:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66154710] [2022-07-21 17:12:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:07,022 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,174 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2022-07-21 17:12:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:12:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:12:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,176 INFO L225 Difference]: With dead ends: 274 [2022-07-21 17:12:07,176 INFO L226 Difference]: Without dead ends: 274 [2022-07-21 17:12:07,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:12:07,177 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 123 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 413 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-21 17:12:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2022-07-21 17:12:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2022-07-21 17:12:07,180 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2022-07-21 17:12:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,181 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2022-07-21 17:12:07,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2022-07-21 17:12:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:12:07,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:12:07,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2022-07-21 17:12:07,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637230170] [2022-07-21 17:12:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637230170] [2022-07-21 17:12:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637230170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:12:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599301096] [2022-07-21 17:12:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:07,235 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-21 17:12:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,385 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2022-07-21 17:12:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:12:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-21 17:12:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,386 INFO L225 Difference]: With dead ends: 273 [2022-07-21 17:12:07,386 INFO L226 Difference]: Without dead ends: 273 [2022-07-21 17:12:07,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:12:07,387 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 126 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 417 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-21 17:12:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2022-07-21 17:12:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2022-07-21 17:12:07,391 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2022-07-21 17:12:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,392 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2022-07-21 17:12:07,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-21 17:12:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2022-07-21 17:12:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:12:07,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:12:07,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2022-07-21 17:12:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726517852] [2022-07-21 17:12:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726517852] [2022-07-21 17:12:07,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726517852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741872011] [2022-07-21 17:12:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:12:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:12:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:12:07,421 INFO L87 Difference]: Start difference. First operand 228 states and 309 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-21 17:12:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,492 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2022-07-21 17:12:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:12:07,492 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-21 17:12:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,493 INFO L225 Difference]: With dead ends: 266 [2022-07-21 17:12:07,493 INFO L226 Difference]: Without dead ends: 266 [2022-07-21 17:12:07,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:07,494 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-21 17:12:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2022-07-21 17:12:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2022-07-21 17:12:07,498 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2022-07-21 17:12:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,498 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2022-07-21 17:12:07,498 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-21 17:12:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2022-07-21 17:12:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:12:07,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:12:07,500 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2022-07-21 17:12:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472868892] [2022-07-21 17:12:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472868892] [2022-07-21 17:12:07,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472868892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:12:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125537627] [2022-07-21 17:12:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:12:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:12:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:07,546 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,640 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2022-07-21 17:12:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:12:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,642 INFO L225 Difference]: With dead ends: 228 [2022-07-21 17:12:07,642 INFO L226 Difference]: Without dead ends: 228 [2022-07-21 17:12:07,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:12:07,642 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 287 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-21 17:12:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-07-21 17:12:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2022-07-21 17:12:07,645 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2022-07-21 17:12:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,646 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2022-07-21 17:12:07,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-07-21 17:12:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:12:07,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:12:07,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2022-07-21 17:12:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920124506] [2022-07-21 17:12:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920124506] [2022-07-21 17:12:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920124506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:12:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052533278] [2022-07-21 17:12:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:12:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:12:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:07,688 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,794 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2022-07-21 17:12:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:12:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,795 INFO L225 Difference]: With dead ends: 227 [2022-07-21 17:12:07,795 INFO L226 Difference]: Without dead ends: 227 [2022-07-21 17:12:07,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:12:07,796 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-21 17:12:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-21 17:12:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2022-07-21 17:12:07,799 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2022-07-21 17:12:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,799 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2022-07-21 17:12:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2022-07-21 17:12:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:12:07,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:12:07,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2022-07-21 17:12:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154029821] [2022-07-21 17:12:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:07,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154029821] [2022-07-21 17:12:07,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154029821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:07,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:07,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:12:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068119082] [2022-07-21 17:12:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:07,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:07,852 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:07,987 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2022-07-21 17:12:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 17:12:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:07,988 INFO L225 Difference]: With dead ends: 243 [2022-07-21 17:12:07,988 INFO L226 Difference]: Without dead ends: 243 [2022-07-21 17:12:07,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:12:07,989 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:07,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 301 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-21 17:12:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2022-07-21 17:12:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2022-07-21 17:12:07,992 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2022-07-21 17:12:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:07,993 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2022-07-21 17:12:07,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2022-07-21 17:12:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:12:07,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:07,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:07,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:12:07,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:07,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2022-07-21 17:12:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:07,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935504800] [2022-07-21 17:12:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935504800] [2022-07-21 17:12:08,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935504800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:08,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:08,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:12:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610648616] [2022-07-21 17:12:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:08,036 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:08,164 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2022-07-21 17:12:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:12:08,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 17:12:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:08,165 INFO L225 Difference]: With dead ends: 236 [2022-07-21 17:12:08,165 INFO L226 Difference]: Without dead ends: 236 [2022-07-21 17:12:08,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:12:08,166 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:08,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 415 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-21 17:12:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2022-07-21 17:12:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.5406976744186047) internal successors, (265), 205 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2022-07-21 17:12:08,169 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 19 [2022-07-21 17:12:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:08,169 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2022-07-21 17:12:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2022-07-21 17:12:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:12:08,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:08,169 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:08,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:12:08,169 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2022-07-21 17:12:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:08,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495625055] [2022-07-21 17:12:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:08,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495625055] [2022-07-21 17:12:08,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495625055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:08,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:08,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:12:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121647735] [2022-07-21 17:12:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:08,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:12:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:12:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:08,190 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:08,196 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-07-21 17:12:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:12:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-21 17:12:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:08,197 INFO L225 Difference]: With dead ends: 181 [2022-07-21 17:12:08,198 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 17:12:08,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:12:08,198 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:08,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:12:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 17:12:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-07-21 17:12:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2022-07-21 17:12:08,201 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 20 [2022-07-21 17:12:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:08,201 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2022-07-21 17:12:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2022-07-21 17:12:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:12:08,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:08,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:08,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:12:08,202 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2022-07-21 17:12:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:08,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076000891] [2022-07-21 17:12:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:08,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076000891] [2022-07-21 17:12:08,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076000891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:08,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807822970] [2022-07-21 17:12:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:08,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:08,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:08,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:12:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:08,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:12:08,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:08,365 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:12:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807822970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:08,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:08,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-21 17:12:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491792555] [2022-07-21 17:12:08,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:08,409 INFO L87 Difference]: Start difference. First operand 179 states and 214 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-21 17:12:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:08,531 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2022-07-21 17:12:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:12:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:12:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:08,532 INFO L225 Difference]: With dead ends: 189 [2022-07-21 17:12:08,532 INFO L226 Difference]: Without dead ends: 173 [2022-07-21 17:12:08,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:12:08,533 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:08,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 356 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-07-21 17:12:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-21 17:12:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-07-21 17:12:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.4963503649635037) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2022-07-21 17:12:08,535 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 21 [2022-07-21 17:12:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:08,536 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2022-07-21 17:12:08,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-21 17:12:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-07-21 17:12:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:12:08,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:08,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:08,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:08,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 17:12:08,753 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2022-07-21 17:12:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:08,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628921708] [2022-07-21 17:12:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:08,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628921708] [2022-07-21 17:12:08,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628921708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:08,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:08,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:12:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099641492] [2022-07-21 17:12:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:08,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:12:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:08,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:12:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:12:08,812 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:08,984 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2022-07-21 17:12:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:12:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:12:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:08,985 INFO L225 Difference]: With dead ends: 172 [2022-07-21 17:12:08,985 INFO L226 Difference]: Without dead ends: 172 [2022-07-21 17:12:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:12:08,986 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 95 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:08,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 199 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-21 17:12:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2022-07-21 17:12:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 169 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-21 17:12:08,988 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 21 [2022-07-21 17:12:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:08,988 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-21 17:12:08,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-21 17:12:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:12:08,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:08,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:08,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:12:08,989 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2022-07-21 17:12:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:08,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959204471] [2022-07-21 17:12:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:09,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959204471] [2022-07-21 17:12:09,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959204471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:09,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:09,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:12:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109587196] [2022-07-21 17:12:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:09,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:12:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:12:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:12:09,095 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:09,358 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2022-07-21 17:12:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:12:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:12:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:09,360 INFO L225 Difference]: With dead ends: 171 [2022-07-21 17:12:09,360 INFO L226 Difference]: Without dead ends: 171 [2022-07-21 17:12:09,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:12:09,361 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 257 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:12:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-21 17:12:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-07-21 17:12:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.467153284671533) internal successors, (201), 168 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2022-07-21 17:12:09,364 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 21 [2022-07-21 17:12:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:09,364 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2022-07-21 17:12:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2022-07-21 17:12:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:12:09,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:09,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:09,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:12:09,365 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2022-07-21 17:12:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:09,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926567601] [2022-07-21 17:12:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926567601] [2022-07-21 17:12:09,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926567601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:09,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:09,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:12:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193329933] [2022-07-21 17:12:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:12:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:12:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:09,400 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:09,494 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-07-21 17:12:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:12:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:09,495 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:12:09,495 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:12:09,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:12:09,496 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:09,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:12:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-21 17:12:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 167 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2022-07-21 17:12:09,502 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 22 [2022-07-21 17:12:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:09,502 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2022-07-21 17:12:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2022-07-21 17:12:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:12:09,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:09,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:09,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:12:09,503 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2022-07-21 17:12:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327335428] [2022-07-21 17:12:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327335428] [2022-07-21 17:12:09,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327335428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:09,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:09,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:12:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738915953] [2022-07-21 17:12:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:09,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:12:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:12:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:12:09,575 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:09,680 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2022-07-21 17:12:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:12:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:09,681 INFO L225 Difference]: With dead ends: 167 [2022-07-21 17:12:09,681 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 17:12:09,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:12:09,681 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:09,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 17:12:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-21 17:12:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 137 states have (on average 1.437956204379562) internal successors, (197), 166 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2022-07-21 17:12:09,683 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 22 [2022-07-21 17:12:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:09,684 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2022-07-21 17:12:09,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2022-07-21 17:12:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:12:09,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:09,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:09,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 17:12:09,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2022-07-21 17:12:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:09,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142495255] [2022-07-21 17:12:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142495255] [2022-07-21 17:12:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142495255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:12:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086966244] [2022-07-21 17:12:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:12:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:12:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:12:09,770 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:09,982 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2022-07-21 17:12:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:12:09,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 17:12:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:09,984 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:12:09,984 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:12:09,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:12:09,984 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:12:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:12:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-07-21 17:12:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 165 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2022-07-21 17:12:09,987 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 25 [2022-07-21 17:12:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:09,992 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2022-07-21 17:12:09,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2022-07-21 17:12:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:12:09,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:09,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:09,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 17:12:09,993 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2022-07-21 17:12:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:09,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543450728] [2022-07-21 17:12:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543450728] [2022-07-21 17:12:10,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543450728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:10,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:10,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:12:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490099528] [2022-07-21 17:12:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:12:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:12:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:12:10,095 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:10,296 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2022-07-21 17:12:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:12:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 17:12:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:10,297 INFO L225 Difference]: With dead ends: 167 [2022-07-21 17:12:10,298 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 17:12:10,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:12:10,300 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:10,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 185 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 17:12:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-07-21 17:12:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.4233576642335766) internal successors, (195), 164 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2022-07-21 17:12:10,302 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 25 [2022-07-21 17:12:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:10,303 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2022-07-21 17:12:10,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2022-07-21 17:12:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:12:10,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:10,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:10,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 17:12:10,305 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2022-07-21 17:12:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732401628] [2022-07-21 17:12:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732401628] [2022-07-21 17:12:10,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732401628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131920725] [2022-07-21 17:12:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:10,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:10,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:10,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:10,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:12:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:10,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 17:12:10,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:10,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:12:10,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:12:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:10,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:11,079 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-21 17:12:11,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-21 17:12:11,087 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-21 17:12:11,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 17:12:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:11,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131920725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:11,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:11,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 23 [2022-07-21 17:12:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958064518] [2022-07-21 17:12:11,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:11,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 17:12:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 17:12:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:12:11,288 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:11,758 INFO L93 Difference]: Finished difference Result 355 states and 418 transitions. [2022-07-21 17:12:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:12:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 17:12:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:11,759 INFO L225 Difference]: With dead ends: 355 [2022-07-21 17:12:11,759 INFO L226 Difference]: Without dead ends: 355 [2022-07-21 17:12:11,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2022-07-21 17:12:11,760 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 609 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:11,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 705 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 410 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-07-21 17:12:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-21 17:12:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 236. [2022-07-21 17:12:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 235 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 281 transitions. [2022-07-21 17:12:11,765 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 281 transitions. Word has length 38 [2022-07-21 17:12:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:11,765 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 281 transitions. [2022-07-21 17:12:11,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 281 transitions. [2022-07-21 17:12:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:12:11,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:11,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:11,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:11,985 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,SelfDestructingSolverStorable23 [2022-07-21 17:12:11,985 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1767960844, now seen corresponding path program 1 times [2022-07-21 17:12:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:11,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794486456] [2022-07-21 17:12:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:12:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794486456] [2022-07-21 17:12:12,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794486456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:12,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:12,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:12:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643362780] [2022-07-21 17:12:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:12:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:12:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:12:12,191 INFO L87 Difference]: Start difference. First operand 236 states and 281 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:12,893 INFO L93 Difference]: Finished difference Result 338 states and 394 transitions. [2022-07-21 17:12:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:12:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 17:12:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:12,895 INFO L225 Difference]: With dead ends: 338 [2022-07-21 17:12:12,895 INFO L226 Difference]: Without dead ends: 338 [2022-07-21 17:12:12,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:12:12,895 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 246 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:12,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 630 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:12:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-21 17:12:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 222. [2022-07-21 17:12:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 221 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2022-07-21 17:12:12,898 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 38 [2022-07-21 17:12:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:12,898 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2022-07-21 17:12:12,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-07-21 17:12:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:12:12,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:12,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:12,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 17:12:12,899 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2022-07-21 17:12:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669163653] [2022-07-21 17:12:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:13,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669163653] [2022-07-21 17:12:13,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669163653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:13,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724966589] [2022-07-21 17:12:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:13,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:13,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:12:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:13,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 17:12:13,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:13,412 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:12:13,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:12:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:12:13,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:12:13,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:12:13,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:12:13,526 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:13,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-21 17:12:13,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 20 treesize of output 22 [2022-07-21 17:12:13,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:13,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-21 17:12:13,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:12:13,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-21 17:12:13,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:12:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:13,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:13,667 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_583 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-21 17:12:13,673 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_583 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-21 17:12:13,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_583)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-21 17:12:13,693 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_582))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_580))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_583))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-21 17:12:13,708 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_577 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= 0 (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_577)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_581) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_582)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_580))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_583))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-21 17:12:13,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:13,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:13,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2022-07-21 17:12:13,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:13,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:13,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 90 [2022-07-21 17:12:13,997 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:12:13,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:12:14,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:14,023 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-07-21 17:12:14,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 284 treesize of output 182 [2022-07-21 17:12:14,030 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-21 17:12:14,031 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 253 treesize of output 241 [2022-07-21 17:12:14,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:14,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2022-07-21 17:12:14,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 98 treesize of output 94 [2022-07-21 17:12:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:14,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724966589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:14,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:14,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2022-07-21 17:12:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176132159] [2022-07-21 17:12:14,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:12:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:12:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=673, Unknown=5, NotChecked=290, Total=1122 [2022-07-21 17:12:14,087 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:15,467 INFO L93 Difference]: Finished difference Result 776 states and 926 transitions. [2022-07-21 17:12:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 17:12:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 17:12:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:15,469 INFO L225 Difference]: With dead ends: 776 [2022-07-21 17:12:15,469 INFO L226 Difference]: Without dead ends: 776 [2022-07-21 17:12:15,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=549, Invalid=2013, Unknown=8, NotChecked=510, Total=3080 [2022-07-21 17:12:15,470 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 602 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2044 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:15,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1948 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1476 Invalid, 0 Unknown, 2044 Unchecked, 0.6s Time] [2022-07-21 17:12:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-07-21 17:12:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 278. [2022-07-21 17:12:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 250 states have (on average 1.332) internal successors, (333), 277 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2022-07-21 17:12:15,476 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 38 [2022-07-21 17:12:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:15,477 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2022-07-21 17:12:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2022-07-21 17:12:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:12:15,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:15,477 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:15,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:15,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:15,693 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2022-07-21 17:12:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435103101] [2022-07-21 17:12:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435103101] [2022-07-21 17:12:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435103101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431802067] [2022-07-21 17:12:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:15,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:15,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:12:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:12:15,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:16,029 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:12:16,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:12:16,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:12:16,124 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 17:12:16,159 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:16,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-21 17:12:16,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:12:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:16,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:16,267 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-21 17:12:16,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 17:12:16,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem16#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) is different from false [2022-07-21 17:12:16,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-21 17:12:16,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_654))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-21 17:12:16,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_654))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-21 17:12:16,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:16,288 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 51 treesize of output 36 [2022-07-21 17:12:16,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:16,297 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 256 treesize of output 195 [2022-07-21 17:12:16,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:16,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 166 [2022-07-21 17:12:16,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2022-07-21 17:12:16,635 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:12:16,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:12:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:16,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431802067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:16,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:16,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-07-21 17:12:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879835847] [2022-07-21 17:12:16,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:16,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:12:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:16,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:12:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=466, Unknown=4, NotChecked=188, Total=756 [2022-07-21 17:12:16,641 INFO L87 Difference]: Start difference. First operand 278 states and 333 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:17,780 INFO L93 Difference]: Finished difference Result 809 states and 974 transitions. [2022-07-21 17:12:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 17:12:17,783 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-21 17:12:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:17,785 INFO L225 Difference]: With dead ends: 809 [2022-07-21 17:12:17,785 INFO L226 Difference]: Without dead ends: 809 [2022-07-21 17:12:17,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=1585, Unknown=4, NotChecked=356, Total=2352 [2022-07-21 17:12:17,786 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1051 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1631 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:17,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1235 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1698 Invalid, 0 Unknown, 1631 Unchecked, 0.7s Time] [2022-07-21 17:12:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-21 17:12:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 402. [2022-07-21 17:12:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 374 states have (on average 1.358288770053476) internal successors, (508), 401 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 508 transitions. [2022-07-21 17:12:17,793 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 508 transitions. Word has length 39 [2022-07-21 17:12:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 508 transitions. [2022-07-21 17:12:17,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 508 transitions. [2022-07-21 17:12:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:12:17,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:17,794 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:17,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 17:12:18,011 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2022-07-21 17:12:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:18,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909091786] [2022-07-21 17:12:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909091786] [2022-07-21 17:12:18,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909091786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089628258] [2022-07-21 17:12:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:18,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:12:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:18,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 17:12:18,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:18,377 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:12:18,387 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:12:18,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:12:18,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:12:18,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:12:18,509 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-21 17:12:18,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:12:18,556 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:18,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-21 17:12:18,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:12:18,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:12:18,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:12:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:18,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:18,835 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-21 17:12:18,842 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2022-07-21 17:12:18,864 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_729))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_730) .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-21 17:12:18,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_729))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_730) .cse1 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_729) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-21 17:12:18,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:18,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-21 17:12:18,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:18,890 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 28 treesize of output 29 [2022-07-21 17:12:18,893 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 50 treesize of output 42 [2022-07-21 17:12:18,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:18,899 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 100 treesize of output 99 [2022-07-21 17:12:18,910 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 60 treesize of output 52 [2022-07-21 17:12:18,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2022-07-21 17:12:18,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-21 17:12:18,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:18,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-21 17:12:18,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:18,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 17:12:18,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:18,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:18,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-21 17:12:18,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:18,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-21 17:12:18,987 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 13 treesize of output 11 [2022-07-21 17:12:19,121 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:12:19,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:12:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089628258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:19,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:19,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-21 17:12:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809932118] [2022-07-21 17:12:19,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:19,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:12:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:12:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=748, Unknown=4, NotChecked=236, Total=1122 [2022-07-21 17:12:19,129 INFO L87 Difference]: Start difference. First operand 402 states and 508 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:21,014 INFO L93 Difference]: Finished difference Result 964 states and 1163 transitions. [2022-07-21 17:12:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-21 17:12:21,015 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-21 17:12:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:21,017 INFO L225 Difference]: With dead ends: 964 [2022-07-21 17:12:21,017 INFO L226 Difference]: Without dead ends: 964 [2022-07-21 17:12:21,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=800, Invalid=3903, Unknown=5, NotChecked=548, Total=5256 [2022-07-21 17:12:21,018 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 1580 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1763 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:21,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1480 Invalid, 3505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1582 Invalid, 0 Unknown, 1763 Unchecked, 0.7s Time] [2022-07-21 17:12:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-07-21 17:12:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 405. [2022-07-21 17:12:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 383 states have (on average 1.349869451697128) internal successors, (517), 404 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 517 transitions. [2022-07-21 17:12:21,025 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 517 transitions. Word has length 39 [2022-07-21 17:12:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:21,026 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 517 transitions. [2022-07-21 17:12:21,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 517 transitions. [2022-07-21 17:12:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:12:21,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:21,026 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:21,045 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-21 17:12:21,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 17:12:21,233 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2022-07-21 17:12:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556526861] [2022-07-21 17:12:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:12:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556526861] [2022-07-21 17:12:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556526861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:21,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:12:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979074837] [2022-07-21 17:12:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:21,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:12:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:12:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:12:21,287 INFO L87 Difference]: Start difference. First operand 405 states and 517 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:21,383 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2022-07-21 17:12:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:12:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-21 17:12:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:21,384 INFO L225 Difference]: With dead ends: 405 [2022-07-21 17:12:21,384 INFO L226 Difference]: Without dead ends: 405 [2022-07-21 17:12:21,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:12:21,385 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:21,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 258 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:12:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-21 17:12:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-21 17:12:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 380 states have (on average 1.3447368421052632) internal successors, (511), 401 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 511 transitions. [2022-07-21 17:12:21,390 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 511 transitions. Word has length 39 [2022-07-21 17:12:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 511 transitions. [2022-07-21 17:12:21,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 511 transitions. [2022-07-21 17:12:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:12:21,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:21,400 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:21,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 17:12:21,400 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2022-07-21 17:12:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:21,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768530131] [2022-07-21 17:12:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768530131] [2022-07-21 17:12:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768530131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:21,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:21,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 17:12:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421465900] [2022-07-21 17:12:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:21,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:12:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:12:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:12:21,607 INFO L87 Difference]: Start difference. First operand 402 states and 511 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-21 17:12:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:22,171 INFO L93 Difference]: Finished difference Result 543 states and 671 transitions. [2022-07-21 17:12:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:12:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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) Word has length 39 [2022-07-21 17:12:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:22,173 INFO L225 Difference]: With dead ends: 543 [2022-07-21 17:12:22,173 INFO L226 Difference]: Without dead ends: 543 [2022-07-21 17:12:22,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2022-07-21 17:12:22,174 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 253 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:22,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 847 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:12:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-21 17:12:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 396. [2022-07-21 17:12:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 374 states have (on average 1.36096256684492) internal successors, (509), 395 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2022-07-21 17:12:22,179 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 39 [2022-07-21 17:12:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:22,179 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2022-07-21 17:12:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-21 17:12:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2022-07-21 17:12:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:12:22,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:22,180 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:22,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 17:12:22,180 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash 982584715, now seen corresponding path program 1 times [2022-07-21 17:12:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480981259] [2022-07-21 17:12:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480981259] [2022-07-21 17:12:22,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480981259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:22,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:22,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:12:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083779110] [2022-07-21 17:12:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:12:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:12:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:12:22,332 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:22,782 INFO L93 Difference]: Finished difference Result 595 states and 734 transitions. [2022-07-21 17:12:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:12:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-21 17:12:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:22,784 INFO L225 Difference]: With dead ends: 595 [2022-07-21 17:12:22,784 INFO L226 Difference]: Without dead ends: 591 [2022-07-21 17:12:22,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2022-07-21 17:12:22,784 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 465 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:22,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 548 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:12:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-21 17:12:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 446. [2022-07-21 17:12:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 424 states have (on average 1.3514150943396226) internal successors, (573), 445 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 573 transitions. [2022-07-21 17:12:22,790 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 573 transitions. Word has length 41 [2022-07-21 17:12:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 573 transitions. [2022-07-21 17:12:22,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 573 transitions. [2022-07-21 17:12:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:12:22,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:22,790 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:22,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 17:12:22,790 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2022-07-21 17:12:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:22,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585552885] [2022-07-21 17:12:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585552885] [2022-07-21 17:12:22,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585552885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193750527] [2022-07-21 17:12:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:22,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:22,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:12:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:23,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:12:23,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:23,163 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:12:23,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:12:23,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:12:23,265 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:23,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:12:23,311 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:12:23,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:23,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-21 17:12:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:23,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:23,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:23,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-21 17:12:23,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:23,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 255 [2022-07-21 17:12:23,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:23,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 216 [2022-07-21 17:12:23,762 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 204 treesize of output 188 [2022-07-21 17:12:37,702 INFO L356 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2022-07-21 17:12:37,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 191 treesize of output 394 [2022-07-21 17:12:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193750527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:40,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-21 17:12:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781268473] [2022-07-21 17:12:40,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:40,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 17:12:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 17:12:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=983, Unknown=21, NotChecked=0, Total=1190 [2022-07-21 17:12:40,726 INFO L87 Difference]: Start difference. First operand 446 states and 573 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:41,623 INFO L93 Difference]: Finished difference Result 684 states and 863 transitions. [2022-07-21 17:12:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 17:12:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-21 17:12:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:41,625 INFO L225 Difference]: With dead ends: 684 [2022-07-21 17:12:41,625 INFO L226 Difference]: Without dead ends: 684 [2022-07-21 17:12:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=2178, Unknown=21, NotChecked=0, Total=2756 [2022-07-21 17:12:41,626 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 866 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1131 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:41,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1345 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 812 Invalid, 0 Unknown, 1131 Unchecked, 0.4s Time] [2022-07-21 17:12:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-21 17:12:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 526. [2022-07-21 17:12:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 504 states have (on average 1.3551587301587302) internal successors, (683), 525 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 683 transitions. [2022-07-21 17:12:41,633 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 683 transitions. Word has length 41 [2022-07-21 17:12:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:41,633 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 683 transitions. [2022-07-21 17:12:41,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 683 transitions. [2022-07-21 17:12:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:12:41,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:41,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:41,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:41,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:41,834 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341772, now seen corresponding path program 1 times [2022-07-21 17:12:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:41,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596255218] [2022-07-21 17:12:41,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:42,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596255218] [2022-07-21 17:12:42,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596255218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:42,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756489003] [2022-07-21 17:12:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:42,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:42,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:42,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:42,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:12:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:42,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 17:12:42,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:42,307 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:12:42,313 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:12:42,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:12:42,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:12:42,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:12:42,397 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:42,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-21 17:12:42,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:12:42,439 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:42,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-21 17:12:42,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:12:42,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:42,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-21 17:12:42,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:42,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:12:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:42,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:12:42,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_74| Int) (v_ArrVal_984 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (let ((.cse1 (+ |v_ULTIMATE.start_main_~n~0#1.offset_74| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_983) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_74| |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-21 17:12:42,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:42,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-21 17:12:42,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-21 17:12:42,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:42,975 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 754 treesize of output 655 [2022-07-21 17:12:42,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:42,996 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 2262 treesize of output 2127 [2022-07-21 17:12:43,013 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 2108 treesize of output 2044 [2022-07-21 17:12:43,022 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 2044 treesize of output 1884 [2022-07-21 17:12:43,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:43,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1884 treesize of output 1600 [2022-07-21 17:12:43,062 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 1588 treesize of output 1428 [2022-07-21 17:12:54,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:54,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-21 17:12:54,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:12:54,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:12:54,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:54,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-21 17:12:54,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:54,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:12:54,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-21 17:12:54,957 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:12:54,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:12:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:55,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756489003] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:12:55,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:12:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2022-07-21 17:12:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106225812] [2022-07-21 17:12:55,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:12:55,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 17:12:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 17:12:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1120, Unknown=31, NotChecked=70, Total=1406 [2022-07-21 17:12:55,028 INFO L87 Difference]: Start difference. First operand 526 states and 683 transitions. Second operand has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:57,119 INFO L93 Difference]: Finished difference Result 1428 states and 1816 transitions. [2022-07-21 17:12:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 17:12:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-21 17:12:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:57,123 INFO L225 Difference]: With dead ends: 1428 [2022-07-21 17:12:57,123 INFO L226 Difference]: Without dead ends: 1428 [2022-07-21 17:12:57,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=893, Invalid=3501, Unknown=32, NotChecked=130, Total=4556 [2022-07-21 17:12:57,124 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1685 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1406 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:57,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 1867 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2085 Invalid, 0 Unknown, 1406 Unchecked, 1.0s Time] [2022-07-21 17:12:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2022-07-21 17:12:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 908. [2022-07-21 17:12:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3871331828442437) internal successors, (1229), 907 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1229 transitions. [2022-07-21 17:12:57,135 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1229 transitions. Word has length 41 [2022-07-21 17:12:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:57,136 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1229 transitions. [2022-07-21 17:12:57,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1229 transitions. [2022-07-21 17:12:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:12:57,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:57,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:57,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:12:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:57,353 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1351336816, now seen corresponding path program 1 times [2022-07-21 17:12:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426276858] [2022-07-21 17:12:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426276858] [2022-07-21 17:12:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426276858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:57,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:57,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:12:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69735670] [2022-07-21 17:12:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:57,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:12:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:57,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:12:57,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:12:57,520 INFO L87 Difference]: Start difference. First operand 908 states and 1229 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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-21 17:12:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:57,845 INFO L93 Difference]: Finished difference Result 1201 states and 1588 transitions. [2022-07-21 17:12:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:12:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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) Word has length 43 [2022-07-21 17:12:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:57,848 INFO L225 Difference]: With dead ends: 1201 [2022-07-21 17:12:57,848 INFO L226 Difference]: Without dead ends: 1195 [2022-07-21 17:12:57,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:12:57,849 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 257 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:57,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 692 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:12:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-07-21 17:12:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 886. [2022-07-21 17:12:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 864 states have (on average 1.3854166666666667) internal successors, (1197), 885 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1197 transitions. [2022-07-21 17:12:57,860 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1197 transitions. Word has length 43 [2022-07-21 17:12:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:57,860 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1197 transitions. [2022-07-21 17:12:57,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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-21 17:12:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1197 transitions. [2022-07-21 17:12:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:12:57,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:57,861 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:57,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 17:12:57,861 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -556665744, now seen corresponding path program 1 times [2022-07-21 17:12:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496004976] [2022-07-21 17:12:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496004976] [2022-07-21 17:12:58,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496004976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:12:58,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:12:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 17:12:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358811907] [2022-07-21 17:12:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:12:58,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:12:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:12:58,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:12:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:12:58,002 INFO L87 Difference]: Start difference. First operand 886 states and 1197 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-21 17:12:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:12:58,587 INFO L93 Difference]: Finished difference Result 1197 states and 1598 transitions. [2022-07-21 17:12:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:12:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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) Word has length 43 [2022-07-21 17:12:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:12:58,590 INFO L225 Difference]: With dead ends: 1197 [2022-07-21 17:12:58,590 INFO L226 Difference]: Without dead ends: 1197 [2022-07-21 17:12:58,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:12:58,590 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 253 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:12:58,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 770 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:12:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2022-07-21 17:12:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 886. [2022-07-21 17:12:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 864 states have (on average 1.380787037037037) internal successors, (1193), 885 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:12:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1193 transitions. [2022-07-21 17:12:58,610 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1193 transitions. Word has length 43 [2022-07-21 17:12:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:12:58,611 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1193 transitions. [2022-07-21 17:12:58,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-21 17:12:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1193 transitions. [2022-07-21 17:12:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:12:58,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:12:58,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:12:58,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-21 17:12:58,613 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:12:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:12:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2022-07-21 17:12:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:12:58,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288640120] [2022-07-21 17:12:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:12:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:12:58,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288640120] [2022-07-21 17:12:58,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288640120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:12:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119864782] [2022-07-21 17:12:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:12:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:12:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:12:58,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:12:58,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:12:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:12:58,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:12:58,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:12:58,986 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:12:58,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:12:59,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:12:59,075 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:12:59,126 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:12:59,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:12:59,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:12:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-21 17:12:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:12:59,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:03,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:03,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-21 17:13:03,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:03,426 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 170 treesize of output 149 [2022-07-21 17:13:03,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:03,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 122 [2022-07-21 17:13:03,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-07-21 17:13:12,893 INFO L356 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2022-07-21 17:13:12,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 380 [2022-07-21 17:13:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:14,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119864782] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:14,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:13:14,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2022-07-21 17:13:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585751774] [2022-07-21 17:13:14,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:14,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 17:13:14,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:13:14,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 17:13:14,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=963, Unknown=17, NotChecked=0, Total=1190 [2022-07-21 17:13:14,753 INFO L87 Difference]: Start difference. First operand 886 states and 1193 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:13:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:15,375 INFO L93 Difference]: Finished difference Result 1117 states and 1494 transitions. [2022-07-21 17:13:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:13:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-21 17:13:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:15,377 INFO L225 Difference]: With dead ends: 1117 [2022-07-21 17:13:15,377 INFO L226 Difference]: Without dead ends: 1117 [2022-07-21 17:13:15,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=331, Invalid=1292, Unknown=17, NotChecked=0, Total=1640 [2022-07-21 17:13:15,378 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 760 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 968 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:15,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1251 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1111 Invalid, 0 Unknown, 968 Unchecked, 0.5s Time] [2022-07-21 17:13:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2022-07-21 17:13:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 890. [2022-07-21 17:13:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 868 states have (on average 1.381336405529954) internal successors, (1199), 889 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:13:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1199 transitions. [2022-07-21 17:13:15,387 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1199 transitions. Word has length 46 [2022-07-21 17:13:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:15,388 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1199 transitions. [2022-07-21 17:13:15,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:13:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1199 transitions. [2022-07-21 17:13:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:13:15,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:15,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:15,406 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-21 17:13:15,605 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,SelfDestructingSolverStorable35 [2022-07-21 17:13:15,606 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:13:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2022-07-21 17:13:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:13:15,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666028634] [2022-07-21 17:13:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:13:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:13:15,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666028634] [2022-07-21 17:13:15,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666028634] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:13:15,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593606165] [2022-07-21 17:13:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:13:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:13:15,800 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:13:15,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:13:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:15,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-21 17:13:15,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:16,011 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:13:16,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:13:16,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:13:16,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-21 17:13:16,164 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:13:16,176 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:13:16,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:13:16,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:13:16,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:13:16,277 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:16,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-21 17:13:16,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 22 treesize of output 24 [2022-07-21 17:13:16,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:16,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-21 17:13:16,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:13:16,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:16,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:13:16,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:16,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:16,442 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 27 treesize of output 16 [2022-07-21 17:13:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:16,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:16,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_83| Int)) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_83| |c_ULTIMATE.start_main_~root~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_83|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~n~0#1.offset_83| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1287) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (and (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (<= 0 .cse0)))))) is different from false [2022-07-21 17:13:16,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:16,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-21 17:13:16,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:16,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-21 17:13:16,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:16,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 349 [2022-07-21 17:13:17,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:17,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1148 treesize of output 1085 [2022-07-21 17:13:17,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 1066 treesize of output 986 [2022-07-21 17:13:17,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 986 treesize of output 954 [2022-07-21 17:13:17,027 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 954 treesize of output 874 [2022-07-21 17:13:17,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:17,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 874 treesize of output 734 [2022-07-21 17:13:18,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:18,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-21 17:13:18,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:18,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 17:13:18,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:18,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-21 17:13:19,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:19,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:13:19,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-21 17:13:19,791 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-21 17:13:19,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2022-07-21 17:13:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:19,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593606165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:19,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:13:19,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 39 [2022-07-21 17:13:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109343014] [2022-07-21 17:13:19,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:19,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 17:13:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:13:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 17:13:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1236, Unknown=27, NotChecked=74, Total=1560 [2022-07-21 17:13:19,851 INFO L87 Difference]: Start difference. First operand 890 states and 1199 transitions. Second operand has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 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-21 17:13:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:21,361 INFO L93 Difference]: Finished difference Result 1404 states and 1851 transitions. [2022-07-21 17:13:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-21 17:13:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 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) Word has length 46 [2022-07-21 17:13:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:21,364 INFO L225 Difference]: With dead ends: 1404 [2022-07-21 17:13:21,364 INFO L226 Difference]: Without dead ends: 1404 [2022-07-21 17:13:21,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=959, Invalid=3847, Unknown=28, NotChecked=136, Total=4970 [2022-07-21 17:13:21,366 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1299 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1037 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:21,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1960 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1644 Invalid, 0 Unknown, 1037 Unchecked, 0.6s Time] [2022-07-21 17:13:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-07-21 17:13:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 952. [2022-07-21 17:13:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 930 states have (on average 1.3731182795698924) internal successors, (1277), 951 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:13:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1277 transitions. [2022-07-21 17:13:21,377 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1277 transitions. Word has length 46 [2022-07-21 17:13:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1277 transitions. [2022-07-21 17:13:21,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 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-21 17:13:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1277 transitions. [2022-07-21 17:13:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:13:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:21,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:21,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:13:21,591 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,SelfDestructingSolverStorable36 [2022-07-21 17:13:21,592 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-21 17:13:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -659497038, now seen corresponding path program 1 times [2022-07-21 17:13:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:13:21,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290504752] [2022-07-21 17:13:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:13:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:13:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290504752] [2022-07-21 17:13:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290504752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:13:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809729050] [2022-07-21 17:13:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:21,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:13:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:13:21,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:13:21,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 17:13:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:21,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 17:13:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:22,013 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:13:22,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:13:22,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:13:22,130 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:22,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 17:13:22,201 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:22,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 17:13:22,393 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-21 17:13:22,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-21 17:13:22,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:13:22,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2022-07-21 17:13:22,582 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:22,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2022-07-21 17:13:22,667 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:22,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2022-07-21 17:13:22,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2022-07-21 17:13:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:22,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:22,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-21 17:13:22,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1404))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1405)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-21 17:13:22,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1404))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1405))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-21 17:13:23,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1404))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1405))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-21 17:13:23,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_22| 1) (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_22|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_22| v_ArrVal_1404))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1405))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1))) is different from false [2022-07-21 17:13:23,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:23,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 131 [2022-07-21 17:13:23,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:23,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:23,360 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 28434 treesize of output 28082 [2022-07-21 17:13:23,463 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 27938 treesize of output 27266 [2022-07-21 17:13:23,556 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 27266 treesize of output 25922 [2022-07-21 17:13:23,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:23,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:23,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26308 treesize of output 26110 [2022-07-21 17:13:24,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:24,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26380 treesize of output 26086