./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec 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/forester-heap/dll-simple-white-blue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af5a9640b82bb5981acfe21e6355734b41317c49 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/forester-heap/dll-simple-white-blue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 af5a9640b82bb5981acfe21e6355734b41317c49 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:37:06,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:37:06,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:37:06,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:37:06,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:37:06,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:37:06,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:37:06,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:37:06,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:37:06,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:37:06,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:37:06,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:37:06,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:37:06,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:37:06,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:37:06,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:37:06,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:37:06,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:37:06,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:37:06,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:37:06,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:37:06,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:37:06,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:37:06,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:37:06,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:37:06,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:37:06,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:37:06,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:37:06,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:37:06,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:37:06,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:37:06,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:37:06,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:37:06,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:37:06,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:37:06,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:37:06,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:37:06,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:37:06,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:37:06,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:37:06,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:37:06,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:37:06,184 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:37:06,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:37:06,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:37:06,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:37:06,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:37:06,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:37:06,188 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:37:06,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:37:06,188 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:37:06,189 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:37:06,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:37:06,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:37:06,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:37:06,190 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:37:06,190 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:37:06,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:37:06,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:37:06,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:37:06,191 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:37:06,191 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:37:06,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:37:06,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:37:06,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:37:06,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:37:06,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:37:06,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:37:06,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:37:06,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:37:06,193 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:37:06,193 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 -> af5a9640b82bb5981acfe21e6355734b41317c49 [2021-08-27 06:37:06,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:37:06,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:37:06,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:37:06,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:37:06,561 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:37:06,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-08-27 06:37:06,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9864b60c9/6b7377d8a9ed47e4a143146b9d0be42d/FLAG79cebd425 [2021-08-27 06:37:07,158 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:37:07,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-08-27 06:37:07,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9864b60c9/6b7377d8a9ed47e4a143146b9d0be42d/FLAG79cebd425 [2021-08-27 06:37:07,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9864b60c9/6b7377d8a9ed47e4a143146b9d0be42d [2021-08-27 06:37:07,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:37:07,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:37:07,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:37:07,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:37:07,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:37:07,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5545cc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07, skipping insertion in model container [2021-08-27 06:37:07,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:37:07,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:37:07,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-08-27 06:37:07,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:37:07,823 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:37:07,888 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-08-27 06:37:07,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:37:07,916 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:37:07,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07 WrapperNode [2021-08-27 06:37:07,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:37:07,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:37:07,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:37:07,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:37:07,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:07,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:37:07,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:37:07,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:37:07,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:37:07,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (1/1) ... [2021-08-27 06:37:08,000 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:37:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:08,017 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) [2021-08-27 06:37:08,019 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 [2021-08-27 06:37:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:37:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:37:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:37:08,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:37:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:37:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:37:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:37:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:37:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:37:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:37:08,058 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:37:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:37:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:37:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:37:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:37:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:37:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:37:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:37:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:37:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:37:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:37:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:37:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:37:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:37:08,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:37:08,802 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 06:37:08,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:08 BoogieIcfgContainer [2021-08-27 06:37:08,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:37:08,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:37:08,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:37:08,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:37:08,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:37:07" (1/3) ... [2021-08-27 06:37:08,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c49542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:37:08, skipping insertion in model container [2021-08-27 06:37:08,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:37:07" (2/3) ... [2021-08-27 06:37:08,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c49542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:37:08, skipping insertion in model container [2021-08-27 06:37:08,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:08" (3/3) ... [2021-08-27 06:37:08,817 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2021-08-27 06:37:08,822 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:37:08,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-08-27 06:37:08,867 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:37:08,877 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:37:08,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-08-27 06:37:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 64 states have (on average 2.1875) internal successors, (140), 123 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:37:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:37:08,901 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:08,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:08,902 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1247820226, now seen corresponding path program 1 times [2021-08-27 06:37:08,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:08,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017786126] [2021-08-27 06:37:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:08,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:09,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:09,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:09,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017786126] [2021-08-27 06:37:09,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017786126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:09,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:09,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:37:09,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856211802] [2021-08-27 06:37:09,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:37:09,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:37:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:09,200 INFO L87 Difference]: Start difference. First operand has 128 states, 64 states have (on average 2.1875) internal successors, (140), 123 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:09,536 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2021-08-27 06:37:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:37:09,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:37:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:09,548 INFO L225 Difference]: With dead ends: 154 [2021-08-27 06:37:09,549 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 06:37:09,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 06:37:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2021-08-27 06:37:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 62 states have (on average 2.0161290322580645) internal successors, (125), 117 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2021-08-27 06:37:09,579 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 7 [2021-08-27 06:37:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:09,580 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2021-08-27 06:37:09,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2021-08-27 06:37:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:37:09,581 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:09,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:09,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:37:09,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1247820225, now seen corresponding path program 1 times [2021-08-27 06:37:09,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:09,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076271938] [2021-08-27 06:37:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:09,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:09,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:09,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076271938] [2021-08-27 06:37:09,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076271938] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:09,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:09,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:37:09,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027780] [2021-08-27 06:37:09,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:37:09,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:37:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:09,664 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:09,908 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2021-08-27 06:37:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:37:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:37:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:09,912 INFO L225 Difference]: With dead ends: 147 [2021-08-27 06:37:09,912 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:37:09,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:37:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:37:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2021-08-27 06:37:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 62 states have (on average 1.967741935483871) internal successors, (122), 114 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-08-27 06:37:09,933 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 7 [2021-08-27 06:37:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:09,933 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-08-27 06:37:09,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-08-27 06:37:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:37:09,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:09,934 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:09,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:37:09,934 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2044142232, now seen corresponding path program 1 times [2021-08-27 06:37:09,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:09,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493449139] [2021-08-27 06:37:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:09,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:10,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:10,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493449139] [2021-08-27 06:37:10,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493449139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:10,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:10,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:37:10,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349557792] [2021-08-27 06:37:10,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:10,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:10,103 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:10,446 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2021-08-27 06:37:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:37:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:37:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:10,455 INFO L225 Difference]: With dead ends: 200 [2021-08-27 06:37:10,455 INFO L226 Difference]: Without dead ends: 200 [2021-08-27 06:37:10,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-27 06:37:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2021-08-27 06:37:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.9215686274509804) internal successors, (196), 151 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2021-08-27 06:37:10,477 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 199 transitions. Word has length 13 [2021-08-27 06:37:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:10,478 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 199 transitions. [2021-08-27 06:37:10,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 199 transitions. [2021-08-27 06:37:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:37:10,479 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:10,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:10,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:37:10,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2044142233, now seen corresponding path program 1 times [2021-08-27 06:37:10,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:10,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726918147] [2021-08-27 06:37:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:10,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:10,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:10,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726918147] [2021-08-27 06:37:10,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726918147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:10,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:10,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:37:10,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748107906] [2021-08-27 06:37:10,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:10,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:10,591 INFO L87 Difference]: Start difference. First operand 155 states and 199 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:10,801 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2021-08-27 06:37:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:37:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:37:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:10,802 INFO L225 Difference]: With dead ends: 153 [2021-08-27 06:37:10,802 INFO L226 Difference]: Without dead ends: 153 [2021-08-27 06:37:10,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-08-27 06:37:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2021-08-27 06:37:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 109 states have (on average 1.6055045871559632) internal successors, (175), 142 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2021-08-27 06:37:10,810 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 13 [2021-08-27 06:37:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:10,811 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2021-08-27 06:37:10,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2021-08-27 06:37:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:37:10,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:10,812 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:10,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:37:10,812 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1300029695, now seen corresponding path program 1 times [2021-08-27 06:37:10,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:10,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004806708] [2021-08-27 06:37:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:10,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:10,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:10,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004806708] [2021-08-27 06:37:10,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004806708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:10,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:10,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:37:10,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045652154] [2021-08-27 06:37:10,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:37:10,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:37:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:10,926 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:11,155 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2021-08-27 06:37:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:37:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:37:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:11,157 INFO L225 Difference]: With dead ends: 145 [2021-08-27 06:37:11,157 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 06:37:11,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 53.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 06:37:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-08-27 06:37:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 141 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2021-08-27 06:37:11,161 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 16 [2021-08-27 06:37:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:11,162 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2021-08-27 06:37:11,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2021-08-27 06:37:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:37:11,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:11,163 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:11,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:37:11,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1300029696, now seen corresponding path program 1 times [2021-08-27 06:37:11,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:11,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070523055] [2021-08-27 06:37:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:11,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:11,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:11,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070523055] [2021-08-27 06:37:11,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070523055] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:11,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:11,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:37:11,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22606212] [2021-08-27 06:37:11,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:37:11,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:11,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:37:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:11,252 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:11,489 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2021-08-27 06:37:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:37:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:37:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:11,490 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:37:11,490 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:37:11,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:37:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-08-27 06:37:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 140 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2021-08-27 06:37:11,494 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 16 [2021-08-27 06:37:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:11,494 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2021-08-27 06:37:11,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2021-08-27 06:37:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:37:11,495 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:11,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:11,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:37:11,495 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -573429058, now seen corresponding path program 1 times [2021-08-27 06:37:11,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:11,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282629174] [2021-08-27 06:37:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:11,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:11,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:11,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282629174] [2021-08-27 06:37:11,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282629174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:11,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:11,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:37:11,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133308362] [2021-08-27 06:37:11,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:37:11,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:37:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:11,614 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:11,839 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2021-08-27 06:37:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:37:11,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:37:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:11,841 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:37:11,841 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:37:11,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:37:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2021-08-27 06:37:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 144 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-08-27 06:37:11,844 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 20 [2021-08-27 06:37:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:11,845 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-08-27 06:37:11,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-08-27 06:37:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:37:11,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:11,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:11,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:37:11,846 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr43REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1184218310, now seen corresponding path program 1 times [2021-08-27 06:37:11,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:11,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958282652] [2021-08-27 06:37:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:11,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:11,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:11,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958282652] [2021-08-27 06:37:11,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958282652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:11,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:11,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:37:11,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825590930] [2021-08-27 06:37:11,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:11,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:11,937 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:12,163 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2021-08-27 06:37:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:37:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:37:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:12,165 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:37:12,165 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:37:12,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:37:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2021-08-27 06:37:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 128 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2021-08-27 06:37:12,168 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 20 [2021-08-27 06:37:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:12,168 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2021-08-27 06:37:12,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2021-08-27 06:37:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:37:12,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:12,169 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:12,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:37:12,169 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1843724223, now seen corresponding path program 1 times [2021-08-27 06:37:12,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:12,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793033487] [2021-08-27 06:37:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:12,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:12,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:12,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793033487] [2021-08-27 06:37:12,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793033487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:12,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:12,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:37:12,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219205579] [2021-08-27 06:37:12,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:37:12,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:12,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:37:12,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:37:12,309 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:12,778 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2021-08-27 06:37:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:37:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:37:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:12,779 INFO L225 Difference]: With dead ends: 136 [2021-08-27 06:37:12,780 INFO L226 Difference]: Without dead ends: 136 [2021-08-27 06:37:12,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 160.9ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:37:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-27 06:37:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2021-08-27 06:37:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 127 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2021-08-27 06:37:12,783 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 20 [2021-08-27 06:37:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:12,783 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2021-08-27 06:37:12,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2021-08-27 06:37:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:37:12,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:12,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:12,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:37:12,785 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1843724222, now seen corresponding path program 1 times [2021-08-27 06:37:12,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:12,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488292244] [2021-08-27 06:37:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:12,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:12,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:12,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488292244] [2021-08-27 06:37:12,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488292244] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:12,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:12,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:37:12,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714777616] [2021-08-27 06:37:12,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:37:12,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:37:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:37:12,967 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:13,566 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2021-08-27 06:37:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:37:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:37:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:13,567 INFO L225 Difference]: With dead ends: 132 [2021-08-27 06:37:13,567 INFO L226 Difference]: Without dead ends: 132 [2021-08-27 06:37:13,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 337.5ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:37:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-27 06:37:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2021-08-27 06:37:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 116 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2021-08-27 06:37:13,570 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 20 [2021-08-27 06:37:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:13,571 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2021-08-27 06:37:13,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2021-08-27 06:37:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:37:13,571 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:13,572 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:13,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:37:13,572 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash 904303381, now seen corresponding path program 1 times [2021-08-27 06:37:13,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:13,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692877422] [2021-08-27 06:37:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:13,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:13,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:13,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692877422] [2021-08-27 06:37:13,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692877422] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:13,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:13,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:37:13,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372167779] [2021-08-27 06:37:13,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:37:13,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:37:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:37:13,659 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:13,961 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2021-08-27 06:37:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:37:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:37:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:13,962 INFO L225 Difference]: With dead ends: 186 [2021-08-27 06:37:13,962 INFO L226 Difference]: Without dead ends: 186 [2021-08-27 06:37:13,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:37:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-27 06:37:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2021-08-27 06:37:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 129 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2021-08-27 06:37:13,966 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 24 [2021-08-27 06:37:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:13,966 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2021-08-27 06:37:13,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2021-08-27 06:37:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:37:13,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:13,967 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:13,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:37:13,967 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1482793211, now seen corresponding path program 1 times [2021-08-27 06:37:13,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:13,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15408897] [2021-08-27 06:37:13,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:13,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:14,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:14,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15408897] [2021-08-27 06:37:14,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15408897] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:14,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754576549] [2021-08-27 06:37:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:14,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:14,101 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) [2021-08-27 06:37:14,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 06:37:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:14,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:37:14,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:14,379 INFO L388 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 [2021-08-27 06:37:14,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:14,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2021-08-27 06:37:14,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:14,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:37:14,641 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:14,642 INFO L388 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 25 treesize of output 25 [2021-08-27 06:37:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:14,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754576549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:14,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:37:14,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2021-08-27 06:37:14,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626245831] [2021-08-27 06:37:14,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:37:14,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:37:14,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:37:14,710 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:15,036 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2021-08-27 06:37:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:37:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:37:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:15,039 INFO L225 Difference]: With dead ends: 164 [2021-08-27 06:37:15,039 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 06:37:15,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 270.7ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:37:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 06:37:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2021-08-27 06:37:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.439252336448598) internal successors, (154), 132 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2021-08-27 06:37:15,049 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 24 [2021-08-27 06:37:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:15,049 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2021-08-27 06:37:15,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2021-08-27 06:37:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:37:15,050 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:15,050 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:15,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:15,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-27 06:37:15,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1279681529, now seen corresponding path program 1 times [2021-08-27 06:37:15,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:15,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252752580] [2021-08-27 06:37:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:15,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:15,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:15,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252752580] [2021-08-27 06:37:15,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252752580] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:15,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:15,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:37:15,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198573755] [2021-08-27 06:37:15,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:37:15,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:37:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:37:15,458 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:15,828 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2021-08-27 06:37:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:37:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:37:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:15,832 INFO L225 Difference]: With dead ends: 165 [2021-08-27 06:37:15,832 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 06:37:15,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:37:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 06:37:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2021-08-27 06:37:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 133 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2021-08-27 06:37:15,835 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 25 [2021-08-27 06:37:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:15,836 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2021-08-27 06:37:15,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2021-08-27 06:37:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:37:15,838 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:15,838 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:15,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:37:15,838 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1279681528, now seen corresponding path program 1 times [2021-08-27 06:37:15,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:15,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974443831] [2021-08-27 06:37:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:15,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:16,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:16,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974443831] [2021-08-27 06:37:16,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974443831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:16,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:16,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:37:16,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520034692] [2021-08-27 06:37:16,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:37:16,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:37:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:37:16,067 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:16,625 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2021-08-27 06:37:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:37:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:37:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:16,626 INFO L225 Difference]: With dead ends: 189 [2021-08-27 06:37:16,627 INFO L226 Difference]: Without dead ends: 189 [2021-08-27 06:37:16,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 177.9ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:37:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-27 06:37:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2021-08-27 06:37:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 135 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2021-08-27 06:37:16,630 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 25 [2021-08-27 06:37:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:16,631 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2021-08-27 06:37:16,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2021-08-27 06:37:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:37:16,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:16,632 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:16,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:37:16,632 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1413298484, now seen corresponding path program 1 times [2021-08-27 06:37:16,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:16,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704427232] [2021-08-27 06:37:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:16,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:16,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:16,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704427232] [2021-08-27 06:37:16,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704427232] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:16,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:16,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 06:37:16,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873363000] [2021-08-27 06:37:16,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:37:16,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:37:16,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:37:16,853 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:17,590 INFO L93 Difference]: Finished difference Result 206 states and 230 transitions. [2021-08-27 06:37:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:37:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:37:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:17,592 INFO L225 Difference]: With dead ends: 206 [2021-08-27 06:37:17,593 INFO L226 Difference]: Without dead ends: 206 [2021-08-27 06:37:17,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 274.9ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:37:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-27 06:37:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2021-08-27 06:37:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 147 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 174 transitions. [2021-08-27 06:37:17,599 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 174 transitions. Word has length 27 [2021-08-27 06:37:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:17,600 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 174 transitions. [2021-08-27 06:37:17,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2021-08-27 06:37:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:37:17,601 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:17,601 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:17,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:37:17,602 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr58ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -863408738, now seen corresponding path program 1 times [2021-08-27 06:37:17,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:17,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401827141] [2021-08-27 06:37:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:17,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:17,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:17,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401827141] [2021-08-27 06:37:17,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401827141] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:17,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:17,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:37:17,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994300061] [2021-08-27 06:37:17,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:17,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:17,656 INFO L87 Difference]: Start difference. First operand 151 states and 174 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:17,848 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2021-08-27 06:37:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:37:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:37:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:17,849 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:37:17,849 INFO L226 Difference]: Without dead ends: 176 [2021-08-27 06:37:17,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-27 06:37:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2021-08-27 06:37:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 147 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2021-08-27 06:37:17,853 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 28 [2021-08-27 06:37:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:17,854 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2021-08-27 06:37:17,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2021-08-27 06:37:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:37:17,855 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:17,855 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:17,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:37:17,855 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 481410755, now seen corresponding path program 1 times [2021-08-27 06:37:17,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:17,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934803963] [2021-08-27 06:37:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:17,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:17,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:17,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934803963] [2021-08-27 06:37:17,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934803963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:17,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:17,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:37:17,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021945759] [2021-08-27 06:37:17,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:37:17,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:37:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:37:17,990 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:18,382 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2021-08-27 06:37:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:37:18,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:37:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:18,384 INFO L225 Difference]: With dead ends: 211 [2021-08-27 06:37:18,384 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 06:37:18,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:37:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 06:37:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 155. [2021-08-27 06:37:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 151 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-08-27 06:37:18,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 29 [2021-08-27 06:37:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:18,390 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-08-27 06:37:18,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-08-27 06:37:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:37:18,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:18,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:18,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:37:18,391 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2037200703, now seen corresponding path program 1 times [2021-08-27 06:37:18,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:18,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463891171] [2021-08-27 06:37:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:18,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:18,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:18,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463891171] [2021-08-27 06:37:18,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463891171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:18,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:18,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:37:18,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425520494] [2021-08-27 06:37:18,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:37:18,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:37:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:37:18,621 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:19,134 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2021-08-27 06:37:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:37:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:37:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:19,136 INFO L225 Difference]: With dead ends: 192 [2021-08-27 06:37:19,137 INFO L226 Difference]: Without dead ends: 192 [2021-08-27 06:37:19,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 171.9ms TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:37:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-27 06:37:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 161. [2021-08-27 06:37:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 157 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2021-08-27 06:37:19,141 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 30 [2021-08-27 06:37:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:19,141 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2021-08-27 06:37:19,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2021-08-27 06:37:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:37:19,142 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:19,142 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:19,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:37:19,143 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -805654302, now seen corresponding path program 1 times [2021-08-27 06:37:19,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:19,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37665614] [2021-08-27 06:37:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:19,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:19,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:19,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:19,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37665614] [2021-08-27 06:37:19,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37665614] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:19,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:19,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:37:19,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337704647] [2021-08-27 06:37:19,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:37:19,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:19,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:37:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:37:19,240 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:19,610 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2021-08-27 06:37:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:37:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:37:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:19,612 INFO L225 Difference]: With dead ends: 210 [2021-08-27 06:37:19,612 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 06:37:19,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 107.9ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:37:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 06:37:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 161. [2021-08-27 06:37:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 157 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2021-08-27 06:37:19,615 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 30 [2021-08-27 06:37:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:19,616 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2021-08-27 06:37:19,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2021-08-27 06:37:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:37:19,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:19,616 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:19,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:37:19,617 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash 7443348, now seen corresponding path program 1 times [2021-08-27 06:37:19,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:19,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331664641] [2021-08-27 06:37:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:19,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:19,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:19,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331664641] [2021-08-27 06:37:19,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331664641] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:19,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179614605] [2021-08-27 06:37:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:19,844 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:19,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:19,858 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) [2021-08-27 06:37:19,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 06:37:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:20,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-27 06:37:20,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:20,042 INFO L388 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 [2021-08-27 06:37:20,086 INFO L388 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 [2021-08-27 06:37:20,092 INFO L388 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 [2021-08-27 06:37:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:37:20,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:37:20,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:37:20,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:37:20,392 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:20,392 INFO L388 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 [2021-08-27 06:37:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,460 INFO L388 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 36 treesize of output 23 [2021-08-27 06:37:20,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,485 INFO L388 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 36 treesize of output 23 [2021-08-27 06:37:20,525 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 06:37:20,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 57 [2021-08-27 06:37:20,543 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 06:37:20,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 66 [2021-08-27 06:37:20,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:20,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,621 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-08-27 06:37:20,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 91 [2021-08-27 06:37:20,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:20,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:20,638 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:37:20,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 74 [2021-08-27 06:37:21,318 INFO L354 Elim1Store]: treesize reduction 65, result has 11.0 percent of original size [2021-08-27 06:37:21,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 66 [2021-08-27 06:37:21,335 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-08-27 06:37:21,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 33 [2021-08-27 06:37:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:21,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179614605] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:21,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:21,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-08-27 06:37:21,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008563383] [2021-08-27 06:37:21,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:37:21,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:37:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:37:21,354 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:22,483 INFO L93 Difference]: Finished difference Result 192 states and 213 transitions. [2021-08-27 06:37:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:37:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:37:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:22,484 INFO L225 Difference]: With dead ends: 192 [2021-08-27 06:37:22,484 INFO L226 Difference]: Without dead ends: 192 [2021-08-27 06:37:22,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 795.0ms TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 06:37:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-27 06:37:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 163. [2021-08-27 06:37:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 159 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2021-08-27 06:37:22,488 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 30 [2021-08-27 06:37:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:22,488 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2021-08-27 06:37:22,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2021-08-27 06:37:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:37:22,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:22,489 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:22,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-27 06:37:22,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-08-27 06:37:22,689 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1361308933, now seen corresponding path program 1 times [2021-08-27 06:37:22,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:22,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86132688] [2021-08-27 06:37:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:22,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:22,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:22,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86132688] [2021-08-27 06:37:22,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86132688] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:22,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27137229] [2021-08-27 06:37:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:22,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:22,933 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) [2021-08-27 06:37:22,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 06:37:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:23,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 06:37:23,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:23,215 INFO L388 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 [2021-08-27 06:37:23,323 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:37:23,324 INFO L388 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 [2021-08-27 06:37:23,380 INFO L388 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 21 treesize of output 17 [2021-08-27 06:37:23,532 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:23,533 INFO L388 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 39 treesize of output 29 [2021-08-27 06:37:23,765 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-08-27 06:37:23,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2021-08-27 06:37:23,830 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:37:23,830 INFO L388 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 37 treesize of output 27 [2021-08-27 06:37:24,065 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:24,065 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2021-08-27 06:37:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:24,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27137229] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:24,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:24,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-08-27 06:37:24,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100629353] [2021-08-27 06:37:24,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 06:37:24,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 06:37:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:37:24,145 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:25,723 INFO L93 Difference]: Finished difference Result 249 states and 276 transitions. [2021-08-27 06:37:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 06:37:25,723 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:37:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:25,724 INFO L225 Difference]: With dead ends: 249 [2021-08-27 06:37:25,725 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 06:37:25,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 970.9ms TimeCoverageRelationStatistics Valid=488, Invalid=1962, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 06:37:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 06:37:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 182. [2021-08-27 06:37:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 178 states have internal predecessors, (204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2021-08-27 06:37:25,730 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 31 [2021-08-27 06:37:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:25,730 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2021-08-27 06:37:25,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2021-08-27 06:37:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:37:25,731 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:25,731 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:25,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:25,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:25,960 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1361308932, now seen corresponding path program 1 times [2021-08-27 06:37:25,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:25,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898314913] [2021-08-27 06:37:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:25,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:26,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:26,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898314913] [2021-08-27 06:37:26,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898314913] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:26,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550118560] [2021-08-27 06:37:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:26,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:26,261 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) [2021-08-27 06:37:26,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 06:37:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:26,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-27 06:37:26,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:26,557 INFO L388 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 [2021-08-27 06:37:26,655 INFO L388 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 [2021-08-27 06:37:26,664 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:26,665 INFO L388 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 [2021-08-27 06:37:26,705 INFO L388 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 [2021-08-27 06:37:26,713 INFO L388 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 21 treesize of output 17 [2021-08-27 06:37:26,869 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:26,869 INFO L388 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 67 treesize of output 49 [2021-08-27 06:37:26,880 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:37:26,881 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:37:27,153 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-08-27 06:37:27,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 83 [2021-08-27 06:37:27,185 INFO L354 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2021-08-27 06:37:27,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 90 treesize of output 79 [2021-08-27 06:37:27,282 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:37:27,283 INFO L388 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 69 treesize of output 51 [2021-08-27 06:37:27,294 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:37:27,294 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-08-27 06:37:27,683 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:27,684 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 46 [2021-08-27 06:37:27,691 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:27,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2021-08-27 06:37:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:27,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550118560] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:27,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:27,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-27 06:37:27,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823138247] [2021-08-27 06:37:27,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 06:37:27,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 06:37:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-08-27 06:37:27,712 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:29,192 INFO L93 Difference]: Finished difference Result 272 states and 302 transitions. [2021-08-27 06:37:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 06:37:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:37:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:29,195 INFO L225 Difference]: With dead ends: 272 [2021-08-27 06:37:29,195 INFO L226 Difference]: Without dead ends: 272 [2021-08-27 06:37:29,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 961.1ms TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 06:37:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-27 06:37:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 197. [2021-08-27 06:37:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 193 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2021-08-27 06:37:29,200 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 31 [2021-08-27 06:37:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:29,200 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2021-08-27 06:37:29,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2021-08-27 06:37:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:37:29,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:29,202 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:29,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:29,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:29,417 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2132846422, now seen corresponding path program 1 times [2021-08-27 06:37:29,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:29,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161187281] [2021-08-27 06:37:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:29,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:29,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:29,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161187281] [2021-08-27 06:37:29,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161187281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:29,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:29,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:37:29,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468103440] [2021-08-27 06:37:29,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:37:29,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:37:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:37:29,474 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:29,639 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2021-08-27 06:37:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:37:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 06:37:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:29,640 INFO L225 Difference]: With dead ends: 211 [2021-08-27 06:37:29,641 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 06:37:29,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:37:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 06:37:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2021-08-27 06:37:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 194 states have internal predecessors, (222), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2021-08-27 06:37:29,645 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 35 [2021-08-27 06:37:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:29,645 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2021-08-27 06:37:29,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2021-08-27 06:37:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:37:29,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:29,645 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:29,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 06:37:29,646 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -333889866, now seen corresponding path program 1 times [2021-08-27 06:37:29,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:29,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17917974] [2021-08-27 06:37:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:29,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:29,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:29,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17917974] [2021-08-27 06:37:29,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17917974] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:29,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443961286] [2021-08-27 06:37:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:29,869 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:29,870 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) [2021-08-27 06:37:29,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 06:37:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:30,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 32 conjunts are in the unsatisfiable core [2021-08-27 06:37:30,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:30,219 INFO L388 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 [2021-08-27 06:37:30,336 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:37:30,336 INFO L388 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 [2021-08-27 06:37:30,391 INFO L388 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 21 treesize of output 17 [2021-08-27 06:37:30,523 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:30,524 INFO L388 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 39 treesize of output 29 [2021-08-27 06:37:30,770 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-08-27 06:37:30,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2021-08-27 06:37:30,834 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:37:30,834 INFO L388 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 37 treesize of output 27 [2021-08-27 06:37:31,042 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:31,043 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2021-08-27 06:37:31,102 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-08-27 06:37:31,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-08-27 06:37:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:31,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443961286] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:31,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:31,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-08-27 06:37:31,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256428113] [2021-08-27 06:37:31,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 06:37:31,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:31,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 06:37:31,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:37:31,350 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:36,376 INFO L93 Difference]: Finished difference Result 364 states and 405 transitions. [2021-08-27 06:37:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 06:37:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:37:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:36,378 INFO L225 Difference]: With dead ends: 364 [2021-08-27 06:37:36,378 INFO L226 Difference]: Without dead ends: 364 [2021-08-27 06:37:36,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1783.6ms TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 06:37:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-08-27 06:37:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 205. [2021-08-27 06:37:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 178 states have (on average 1.297752808988764) internal successors, (231), 201 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 234 transitions. [2021-08-27 06:37:36,384 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 234 transitions. Word has length 36 [2021-08-27 06:37:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:36,384 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 234 transitions. [2021-08-27 06:37:36,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 234 transitions. [2021-08-27 06:37:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:37:36,385 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:36,385 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:36,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:36,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-08-27 06:37:36,586 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash -333889865, now seen corresponding path program 1 times [2021-08-27 06:37:36,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:36,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925770034] [2021-08-27 06:37:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:36,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:36,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:36,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925770034] [2021-08-27 06:37:36,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925770034] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:36,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63151038] [2021-08-27 06:37:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:36,921 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:36,922 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) [2021-08-27 06:37:36,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 06:37:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:37,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-27 06:37:37,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:37,392 INFO L388 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 [2021-08-27 06:37:37,524 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:37:37,524 INFO L388 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 [2021-08-27 06:37:37,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:37:37,598 INFO L388 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 26 treesize of output 22 [2021-08-27 06:37:37,608 INFO L388 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 [2021-08-27 06:37:37,774 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:37,775 INFO L388 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 76 treesize of output 54 [2021-08-27 06:37:37,790 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:37:37,791 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2021-08-27 06:37:38,164 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-08-27 06:37:38,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 81 [2021-08-27 06:37:38,190 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:37:38,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 72 treesize of output 65 [2021-08-27 06:37:38,286 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:37:38,289 INFO L388 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 72 treesize of output 50 [2021-08-27 06:37:38,301 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:37:38,302 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2021-08-27 06:37:38,697 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:38,697 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 50 [2021-08-27 06:37:38,703 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:38,703 INFO L388 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 41 treesize of output 29 [2021-08-27 06:37:38,778 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:37:38,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-08-27 06:37:38,795 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-27 06:37:38,795 INFO L388 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 30 treesize of output 32 [2021-08-27 06:37:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:38,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63151038] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:38,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:38,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-08-27 06:37:38,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441402367] [2021-08-27 06:37:38,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 06:37:38,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 06:37:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:37:38,916 INFO L87 Difference]: Start difference. First operand 205 states and 234 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:40,903 INFO L93 Difference]: Finished difference Result 341 states and 379 transitions. [2021-08-27 06:37:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 06:37:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:37:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:40,905 INFO L225 Difference]: With dead ends: 341 [2021-08-27 06:37:40,905 INFO L226 Difference]: Without dead ends: 341 [2021-08-27 06:37:40,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1290.9ms TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 06:37:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-08-27 06:37:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 208. [2021-08-27 06:37:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.287292817679558) internal successors, (233), 204 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2021-08-27 06:37:40,911 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 36 [2021-08-27 06:37:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:40,912 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2021-08-27 06:37:40,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2021-08-27 06:37:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:37:40,913 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:40,913 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:40,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:41,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:41,117 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1592225079, now seen corresponding path program 2 times [2021-08-27 06:37:41,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:41,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949149935] [2021-08-27 06:37:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:41,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:41,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:41,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949149935] [2021-08-27 06:37:41,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949149935] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:41,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967163762] [2021-08-27 06:37:41,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 06:37:41,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:41,565 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) [2021-08-27 06:37:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 06:37:42,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 06:37:42,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 06:37:42,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-27 06:37:42,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:42,051 INFO L388 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 [2021-08-27 06:37:42,172 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:42,173 INFO L388 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 [2021-08-27 06:37:42,225 INFO L388 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 16 treesize of output 12 [2021-08-27 06:37:42,230 INFO L388 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 [2021-08-27 06:37:42,361 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:42,361 INFO L388 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 58 treesize of output 44 [2021-08-27 06:37:42,372 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:37:42,372 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2021-08-27 06:37:42,630 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-08-27 06:37:42,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 78 [2021-08-27 06:37:42,657 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:37:42,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 69 treesize of output 58 [2021-08-27 06:37:42,720 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:37:42,720 INFO L388 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 62 treesize of output 48 [2021-08-27 06:37:42,731 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:37:42,732 INFO L388 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 54 treesize of output 44 [2021-08-27 06:37:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:43,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967163762] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:43,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:43,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-08-27 06:37:43,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209264392] [2021-08-27 06:37:43,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-27 06:37:43,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-27 06:37:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:37:43,127 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:44,904 INFO L93 Difference]: Finished difference Result 242 states and 266 transitions. [2021-08-27 06:37:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:37:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:37:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:44,906 INFO L225 Difference]: With dead ends: 242 [2021-08-27 06:37:44,906 INFO L226 Difference]: Without dead ends: 242 [2021-08-27 06:37:44,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1250.5ms TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 06:37:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-27 06:37:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 200. [2021-08-27 06:37:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 173 states have (on average 1.283236994219653) internal successors, (222), 196 states have internal predecessors, (222), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2021-08-27 06:37:44,910 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 36 [2021-08-27 06:37:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:44,910 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2021-08-27 06:37:44,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2021-08-27 06:37:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:44,911 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:44,911 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:44,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:45,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:45,129 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 118656232, now seen corresponding path program 1 times [2021-08-27 06:37:45,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:45,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856537518] [2021-08-27 06:37:45,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:45,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:45,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:45,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856537518] [2021-08-27 06:37:45,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856537518] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:45,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440408233] [2021-08-27 06:37:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:45,274 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:45,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:45,281 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) [2021-08-27 06:37:45,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 06:37:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:45,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 06:37:45,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:46,067 INFO L388 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 [2021-08-27 06:37:46,073 INFO L388 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 [2021-08-27 06:37:46,234 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:37:46,234 INFO L388 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 35 treesize of output 30 [2021-08-27 06:37:46,241 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:37:46,241 INFO L388 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 19 [2021-08-27 06:37:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:46,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440408233] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:46,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:46,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-08-27 06:37:46,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581484316] [2021-08-27 06:37:46,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:37:46,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:37:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:37:46,275 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:47,122 INFO L93 Difference]: Finished difference Result 266 states and 288 transitions. [2021-08-27 06:37:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:37:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:37:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:47,124 INFO L225 Difference]: With dead ends: 266 [2021-08-27 06:37:47,124 INFO L226 Difference]: Without dead ends: 266 [2021-08-27 06:37:47,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 431.2ms TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:37:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-08-27 06:37:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2021-08-27 06:37:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.276243093922652) internal successors, (231), 204 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2021-08-27 06:37:47,129 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 38 [2021-08-27 06:37:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:47,129 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2021-08-27 06:37:47,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2021-08-27 06:37:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:47,130 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:47,130 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:47,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-27 06:37:47,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 06:37:47,345 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 481543229, now seen corresponding path program 1 times [2021-08-27 06:37:47,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:47,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866039892] [2021-08-27 06:37:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:47,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:47,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:47,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866039892] [2021-08-27 06:37:47,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866039892] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:47,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202200138] [2021-08-27 06:37:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:47,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:47,589 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) [2021-08-27 06:37:47,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 06:37:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:48,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-27 06:37:48,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:48,143 INFO L388 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 [2021-08-27 06:37:48,186 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:48,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 06:37:48,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 06:37:48,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:48,262 INFO L388 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 22 treesize of output 21 [2021-08-27 06:37:48,666 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:48,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2021-08-27 06:37:48,926 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:37:48,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-08-27 06:37:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:48,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202200138] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:48,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:48,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-08-27 06:37:48,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909923587] [2021-08-27 06:37:48,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-27 06:37:48,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-27 06:37:48,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2021-08-27 06:37:48,984 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:50,347 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2021-08-27 06:37:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:37:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:37:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:50,349 INFO L225 Difference]: With dead ends: 240 [2021-08-27 06:37:50,349 INFO L226 Difference]: Without dead ends: 240 [2021-08-27 06:37:50,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 959.3ms TimeCoverageRelationStatistics Valid=284, Invalid=1786, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 06:37:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-27 06:37:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 222. [2021-08-27 06:37:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.2923076923076924) internal successors, (252), 218 states have internal predecessors, (252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 255 transitions. [2021-08-27 06:37:50,353 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 255 transitions. Word has length 38 [2021-08-27 06:37:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:50,353 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 255 transitions. [2021-08-27 06:37:50,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 255 transitions. [2021-08-27 06:37:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:50,354 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:50,354 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:50,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:50,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 06:37:50,581 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr54REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash 481543230, now seen corresponding path program 1 times [2021-08-27 06:37:50,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:50,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12338039] [2021-08-27 06:37:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:50,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:50,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:50,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12338039] [2021-08-27 06:37:50,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12338039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:50,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101240325] [2021-08-27 06:37:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:50,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:50,793 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) [2021-08-27 06:37:50,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 06:37:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:51,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-27 06:37:51,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:51,433 INFO L388 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 [2021-08-27 06:37:51,443 INFO L388 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 [2021-08-27 06:37:51,942 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:51,943 INFO L388 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 3 case distinctions, treesize of input 57 treesize of output 57 [2021-08-27 06:37:51,956 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:51,957 INFO L388 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 3 case distinctions, treesize of input 51 treesize of output 55 [2021-08-27 06:37:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:52,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101240325] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:52,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:52,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-08-27 06:37:52,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985685888] [2021-08-27 06:37:52,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-27 06:37:52,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:52,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 06:37:52,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-08-27 06:37:52,489 INFO L87 Difference]: Start difference. First operand 222 states and 255 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:54,268 INFO L93 Difference]: Finished difference Result 267 states and 290 transitions. [2021-08-27 06:37:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 06:37:54,269 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:37:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:54,269 INFO L225 Difference]: With dead ends: 267 [2021-08-27 06:37:54,269 INFO L226 Difference]: Without dead ends: 267 [2021-08-27 06:37:54,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1290.4ms TimeCoverageRelationStatistics Valid=433, Invalid=2219, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 06:37:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-08-27 06:37:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 224. [2021-08-27 06:37:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 197 states have (on average 1.284263959390863) internal successors, (253), 220 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 256 transitions. [2021-08-27 06:37:54,274 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 256 transitions. Word has length 38 [2021-08-27 06:37:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:54,274 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 256 transitions. [2021-08-27 06:37:54,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2021-08-27 06:37:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:54,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:54,275 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:37:54,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:54,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-27 06:37:54,489 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 535531503, now seen corresponding path program 1 times [2021-08-27 06:37:54,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:54,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099802587] [2021-08-27 06:37:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:54,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:37:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:54,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:37:54,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099802587] [2021-08-27 06:37:54,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099802587] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:54,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811528973] [2021-08-27 06:37:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:54,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:37:54,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:37:54,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 06:37:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:55,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 54 conjunts are in the unsatisfiable core [2021-08-27 06:37:55,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:55,639 INFO L388 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 [2021-08-27 06:37:55,673 INFO L388 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 [2021-08-27 06:37:55,757 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:55,758 INFO L388 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 [2021-08-27 06:37:55,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:55,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2021-08-27 06:37:55,811 INFO L388 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 16 treesize of output 12 [2021-08-27 06:37:55,955 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:55,955 INFO L388 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 70 treesize of output 52 [2021-08-27 06:37:55,966 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-27 06:37:55,966 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2021-08-27 06:37:56,068 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:56,069 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2021-08-27 06:37:56,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:37:56,182 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:37:56,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 38 treesize of output 29 [2021-08-27 06:37:56,311 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:56,312 INFO L388 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 [2021-08-27 06:37:56,417 INFO L354 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2021-08-27 06:37:56,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 46 [2021-08-27 06:37:56,520 INFO L388 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 [2021-08-27 06:37:56,525 INFO L388 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 43 treesize of output 39 [2021-08-27 06:37:56,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:56,532 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:56,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 06:37:56,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:37:56,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:37:56,601 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:37:56,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 53 treesize of output 40 [2021-08-27 06:37:56,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:56,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2021-08-27 06:37:56,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:56,815 INFO L388 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 1 case distinctions, treesize of input 54 treesize of output 42 [2021-08-27 06:37:56,819 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:37:56,820 INFO L388 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 1 case distinctions, treesize of input 36 treesize of output 24 [2021-08-27 06:37:56,912 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:56,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-08-27 06:37:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:56,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811528973] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:37:56,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:56,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 34 [2021-08-27 06:37:56,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882711547] [2021-08-27 06:37:56,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-27 06:37:56,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:37:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 06:37:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 06:37:56,938 INFO L87 Difference]: Start difference. First operand 224 states and 256 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:58,780 INFO L93 Difference]: Finished difference Result 289 states and 318 transitions. [2021-08-27 06:37:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 06:37:58,780 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:37:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:58,781 INFO L225 Difference]: With dead ends: 289 [2021-08-27 06:37:58,781 INFO L226 Difference]: Without dead ends: 289 [2021-08-27 06:37:58,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1351.7ms TimeCoverageRelationStatistics Valid=405, Invalid=3017, Unknown=0, NotChecked=0, Total=3422 [2021-08-27 06:37:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-27 06:37:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 236. [2021-08-27 06:37:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.2679425837320575) internal successors, (265), 232 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 268 transitions. [2021-08-27 06:37:58,786 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 268 transitions. Word has length 38 [2021-08-27 06:37:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:58,786 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 268 transitions. [2021-08-27 06:37:58,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 268 transitions. [2021-08-27 06:37:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:37:58,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:58,787 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:58,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:59,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:37:59,001 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr58ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:37:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash -616625439, now seen corresponding path program 1 times [2021-08-27 06:37:59,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:37:59,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729063004] [2021-08-27 06:37:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:59,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:37:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:37:59,026 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:37:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:37:59,080 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:37:59,080 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:37:59,081 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr58ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:37:59,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:37:59,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:37:59,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:37:59,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:37:59,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:37:59,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 06:37:59,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:37:59,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 06:37:59,097 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:37:59,122 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:37:59,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:37:59 BoogieIcfgContainer [2021-08-27 06:37:59,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:37:59,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:37:59,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:37:59,143 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:37:59,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:37:08" (3/4) ... [2021-08-27 06:37:59,149 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:37:59,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:37:59,150 INFO L168 Benchmark]: Toolchain (without parser) took 51685.47 ms. Allocated memory was 65.0 MB in the beginning and 360.7 MB in the end (delta: 295.7 MB). Free memory was 44.3 MB in the beginning and 239.4 MB in the end (delta: -195.2 MB). Peak memory consumption was 100.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:37:59,150 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 46.0 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:37:59,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.94 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 42.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:37:59,150 INFO L168 Benchmark]: Boogie Preprocessor took 74.26 ms. Allocated memory is still 65.0 MB. Free memory was 42.0 MB in the beginning and 39.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:37:59,151 INFO L168 Benchmark]: RCFGBuilder took 812.30 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 39.2 MB in the beginning and 52.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:37:59,152 INFO L168 Benchmark]: TraceAbstraction took 50335.83 ms. Allocated memory was 79.7 MB in the beginning and 360.7 MB in the end (delta: 281.0 MB). Free memory was 52.4 MB in the beginning and 239.4 MB in the end (delta: -187.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:37:59,152 INFO L168 Benchmark]: Witness Printer took 6.13 ms. Allocated memory is still 360.7 MB. Free memory is still 239.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:37:59,154 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 46.0 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 451.94 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 42.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.26 ms. Allocated memory is still 65.0 MB. Free memory was 42.0 MB in the beginning and 39.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 812.30 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 39.2 MB in the beginning and 52.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 50335.83 ms. Allocated memory was 79.7 MB in the beginning and 360.7 MB in the end (delta: 281.0 MB). Free memory was 52.4 MB in the beginning and 239.4 MB in the end (delta: -187.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 16.1 GB. * Witness Printer took 6.13 ms. Allocated memory is still 360.7 MB. Free memory is still 239.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 997]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 997. Possible FailurePath: [L1000] SLL* head = malloc(sizeof(SLL)); [L1001] head->next = ((void*)0) VAL [head={-2:0}] [L1002] head->prev = ((void*)0) VAL [head={-2:0}] [L1003] head->data = 0 VAL [head={-2:0}] [L1005] SLL* x = head; VAL [head={-2:0}, x={-2:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1019] COND FALSE !(__VERIFIER_nondet_int()) [L1029] x = head VAL [head={-2:0}, x={-2:0}] [L1030] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}] [L1030] COND FALSE !(x->next != ((void*)0)) [L1037] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}] [L1037] SLL* y = x->next; [L1038] x->next = malloc(sizeof(SLL)) VAL [head={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, y={0:0}] [L1039] x->data = 1 VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1040] x->next = y VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1041] COND FALSE !(y != ((void*)0)) VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1049] x = head VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1052] EXPR x->data VAL [head={-2:0}, x={-2:0}, x->data=1, y={0:0}] [L1052] COND FALSE !(x->data != 1) [L1058] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}, y={0:0}] [L1058] x = x->next [L1059] COND FALSE !(\read(*x)) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1067] x = head VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1068] COND TRUE x != ((void*)0) [L1070] head = x VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1071] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}, y={0:0}] [L1071] x = x->next [L1072] free(head) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1072] free(head) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1072] free(head) [L1068] COND FALSE !(x != ((void*)0)) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1075] return 0; VAL [\result=0, head={-2:0}, x={0:0}, y={0:0}] - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 131 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 50227.5ms, OverallIterations: 31, TraceHistogramMax: 2, EmptinessCheckTime: 27.0ms, AutomataDifference: 25993.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2066 SDtfs, 6502 SDslu, 9009 SDs, 0 SdLazy, 21948 SolverSat, 1573 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 14670.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 333 SyntacticMatches, 23 SemanticMatches, 622 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5196 ImplicationChecksByTransitivity, 13208.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=30, InterpolantAutomatonStates: 451, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 167.7ms AutomataMinimizationTime, 30 MinimizatonAttempts, 1235 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 179.6ms SsaConstructionTime, 642.6ms SatisfiabilityAnalysisTime, 16304.7ms InterpolantComputationTime, 1196 NumberOfCodeBlocks, 1196 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1116 ConstructedInterpolants, 94 QuantifiedInterpolants, 16318 SizeOfPredicates, 143 NumberOfNonLiveVariables, 2335 ConjunctsInSsa, 409 ConjunctsInUnsatCore, 41 InterpolantComputations, 20 PerfectInterpolantSequences, 19/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:37:59,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:38:01,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:38:01,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:38:01,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:38:01,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:38:01,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:38:01,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:38:01,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:38:01,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:38:01,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:38:01,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:38:01,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:38:01,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:38:01,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:38:01,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:38:01,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:38:01,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:38:01,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:38:01,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:38:01,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:38:01,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:38:01,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:38:01,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:38:01,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:38:01,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:38:01,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:38:01,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:38:01,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:38:01,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:38:01,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:38:01,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:38:01,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:38:01,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:38:01,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:38:01,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:38:01,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:38:01,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:38:01,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:38:01,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:38:01,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:38:01,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:38:01,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:38:01,206 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:38:01,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:38:01,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:38:01,207 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:38:01,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:38:01,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:38:01,210 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:38:01,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:38:01,210 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:38:01,210 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:38:01,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:38:01,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:38:01,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:38:01,211 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:38:01,212 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:38:01,213 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:38:01,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:38:01,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:38:01,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:38:01,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:38:01,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:38:01,214 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> af5a9640b82bb5981acfe21e6355734b41317c49 [2021-08-27 06:38:01,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:38:01,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:38:01,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:38:01,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:38:01,534 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:38:01,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-08-27 06:38:01,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8652c6544/8acb245f86e84726a4e7dfefd0f3ac94/FLAG871563983 [2021-08-27 06:38:02,064 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:38:02,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-08-27 06:38:02,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8652c6544/8acb245f86e84726a4e7dfefd0f3ac94/FLAG871563983 [2021-08-27 06:38:02,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8652c6544/8acb245f86e84726a4e7dfefd0f3ac94 [2021-08-27 06:38:02,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:38:02,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:38:02,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:38:02,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:38:02,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:38:02,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260431a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02, skipping insertion in model container [2021-08-27 06:38:02,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:38:02,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:38:02,410 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-08-27 06:38:02,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:38:02,426 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:38:02,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-08-27 06:38:02,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:38:02,484 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:38:02,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02 WrapperNode [2021-08-27 06:38:02,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:38:02,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:38:02,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:38:02,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:38:02,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:38:02,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:38:02,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:38:02,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:38:02,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (1/1) ... [2021-08-27 06:38:02,563 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:38:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:38:02,579 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) [2021-08-27 06:38:02,581 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 [2021-08-27 06:38:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:38:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:38:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:38:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:38:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:38:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:38:02,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:38:02,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:38:02,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:38:02,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:38:02,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:38:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:38:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:38:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:38:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:38:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:38:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:38:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:38:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:38:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:38:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:38:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:38:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:38:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:38:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:38:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:38:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:38:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:38:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:38:03,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:38:03,543 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 06:38:03,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:38:03 BoogieIcfgContainer [2021-08-27 06:38:03,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:38:03,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:38:03,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:38:03,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:38:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:38:02" (1/3) ... [2021-08-27 06:38:03,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bc044c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:38:03, skipping insertion in model container [2021-08-27 06:38:03,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:38:02" (2/3) ... [2021-08-27 06:38:03,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bc044c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:38:03, skipping insertion in model container [2021-08-27 06:38:03,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:38:03" (3/3) ... [2021-08-27 06:38:03,563 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2021-08-27 06:38:03,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:38:03,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-08-27 06:38:03,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:38:03,620 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:38:03,620 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-08-27 06:38:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 62 states have (on average 2.225806451612903) internal successors, (138), 121 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:38:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:38:03,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:03,652 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:03,652 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -26841262, now seen corresponding path program 1 times [2021-08-27 06:38:03,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:03,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046488137] [2021-08-27 06:38:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:03,668 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:03,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:03,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:38:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:03,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:38:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:03,907 INFO L388 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 [2021-08-27 06:38:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:03,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:03,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:03,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046488137] [2021-08-27 06:38:03,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046488137] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:03,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:03,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:38:03,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094682610] [2021-08-27 06:38:03,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:38:03,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:38:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:38:03,996 INFO L87 Difference]: Start difference. First operand has 126 states, 62 states have (on average 2.225806451612903) internal successors, (138), 121 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:04,299 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-08-27 06:38:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:38:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:38:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:04,311 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:38:04,311 INFO L226 Difference]: Without dead ends: 148 [2021-08-27 06:38:04,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:38:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-27 06:38:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-08-27 06:38:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 60 states have (on average 2.05) internal successors, (123), 115 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2021-08-27 06:38:04,353 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 7 [2021-08-27 06:38:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:04,353 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2021-08-27 06:38:04,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2021-08-27 06:38:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:38:04,354 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:04,354 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:04,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:04,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:04,564 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:04,564 INFO L82 PathProgramCache]: Analyzing trace with hash -26841261, now seen corresponding path program 1 times [2021-08-27 06:38:04,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:04,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315554077] [2021-08-27 06:38:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:04,565 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:04,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:04,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:38:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:04,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:38:04,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:04,742 INFO L388 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 [2021-08-27 06:38:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:04,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:04,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:04,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315554077] [2021-08-27 06:38:04,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315554077] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:04,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:04,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:38:04,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904068003] [2021-08-27 06:38:04,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:38:04,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:38:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:38:04,837 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:05,227 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2021-08-27 06:38:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:38:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:38:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:05,229 INFO L225 Difference]: With dead ends: 145 [2021-08-27 06:38:05,229 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 06:38:05,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:38:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 06:38:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2021-08-27 06:38:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 2.0) internal successors, (120), 112 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2021-08-27 06:38:05,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2021-08-27 06:38:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:05,239 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2021-08-27 06:38:05,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2021-08-27 06:38:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:38:05,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:05,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:05,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:05,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:05,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash 125737015, now seen corresponding path program 1 times [2021-08-27 06:38:05,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:05,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522781685] [2021-08-27 06:38:05,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:05,442 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:05,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:05,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:05,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:38:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:05,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:38:05,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:05,609 INFO L388 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 [2021-08-27 06:38:05,684 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:38:05,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 06:38:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:05,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:05,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:05,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522781685] [2021-08-27 06:38:05,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522781685] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:05,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:05,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:38:05,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926084668] [2021-08-27 06:38:05,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:38:05,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:38:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:38:05,823 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:06,180 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2021-08-27 06:38:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:38:06,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:38:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:06,181 INFO L225 Difference]: With dead ends: 116 [2021-08-27 06:38:06,181 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 06:38:06,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:38:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 06:38:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2021-08-27 06:38:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2021-08-27 06:38:06,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 12 [2021-08-27 06:38:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:06,189 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2021-08-27 06:38:06,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2021-08-27 06:38:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:38:06,190 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:06,190 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:06,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:06,400 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 125737016, now seen corresponding path program 1 times [2021-08-27 06:38:06,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:06,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056555605] [2021-08-27 06:38:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:06,401 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:06,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:06,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:38:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:06,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:38:06,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:06,571 INFO L388 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 [2021-08-27 06:38:06,678 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:38:06,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:38:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:06,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:06,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:06,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056555605] [2021-08-27 06:38:06,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056555605] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:06,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:06,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 06:38:06,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502563263] [2021-08-27 06:38:06,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:38:06,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:38:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:06,969 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:07,585 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2021-08-27 06:38:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:38:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:38:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:07,586 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:38:07,586 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:38:07,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 175.7ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:38:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:38:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-08-27 06:38:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.5357142857142858) internal successors, (129), 112 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2021-08-27 06:38:07,593 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 12 [2021-08-27 06:38:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:07,593 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2021-08-27 06:38:07,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2021-08-27 06:38:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:38:07,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:07,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:07,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-27 06:38:07,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:07,801 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash 619955620, now seen corresponding path program 1 times [2021-08-27 06:38:07,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:07,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137775398] [2021-08-27 06:38:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:07,802 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:07,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:38:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:07,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:38:07,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:07,994 INFO L388 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 [2021-08-27 06:38:08,012 INFO L388 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 20 treesize of output 16 [2021-08-27 06:38:08,035 INFO L388 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 21 treesize of output 13 [2021-08-27 06:38:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:08,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:08,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:08,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137775398] [2021-08-27 06:38:08,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137775398] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:08,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:08,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:38:08,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537831613] [2021-08-27 06:38:08,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:38:08,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:38:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:38:08,107 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:08,448 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2021-08-27 06:38:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:38:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:38:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:08,450 INFO L225 Difference]: With dead ends: 115 [2021-08-27 06:38:08,450 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 06:38:08,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 06:38:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-08-27 06:38:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 111 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2021-08-27 06:38:08,459 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 15 [2021-08-27 06:38:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:08,459 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2021-08-27 06:38:08,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2021-08-27 06:38:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:38:08,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:08,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:08,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-27 06:38:08,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:08,668 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash 619955621, now seen corresponding path program 1 times [2021-08-27 06:38:08,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:08,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003744701] [2021-08-27 06:38:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:08,678 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:08,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:08,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:38:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:08,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:38:08,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:08,875 INFO L388 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 [2021-08-27 06:38:08,906 INFO L388 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 17 treesize of output 13 [2021-08-27 06:38:08,915 INFO L388 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 [2021-08-27 06:38:08,953 INFO L388 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 31 treesize of output 23 [2021-08-27 06:38:08,966 INFO L388 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 20 treesize of output 12 [2021-08-27 06:38:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:08,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:09,165 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:09,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003744701] [2021-08-27 06:38:09,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003744701] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:09,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:09,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:38:09,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593517263] [2021-08-27 06:38:09,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:38:09,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:38:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:38:09,167 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:10,034 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2021-08-27 06:38:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:38:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:38:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:10,036 INFO L225 Difference]: With dead ends: 114 [2021-08-27 06:38:10,036 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 06:38:10,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 163.4ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:38:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 06:38:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-08-27 06:38:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 110 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2021-08-27 06:38:10,042 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 15 [2021-08-27 06:38:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:10,042 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2021-08-27 06:38:10,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2021-08-27 06:38:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:38:10,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:10,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:10,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:10,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:10,253 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2102405272, now seen corresponding path program 1 times [2021-08-27 06:38:10,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:10,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2261204] [2021-08-27 06:38:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:10,254 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:10,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:10,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:38:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:10,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:38:10,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:10,442 INFO L388 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 [2021-08-27 06:38:10,448 INFO L388 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 [2021-08-27 06:38:10,489 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:38:10,490 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:38:10,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:10,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:38:10,582 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:38:10,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:38:10,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:10,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:10,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:10,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:38:10,700 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:38:10,701 INFO L388 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 47 treesize of output 33 [2021-08-27 06:38:10,706 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:38:10,707 INFO L388 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 13 [2021-08-27 06:38:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:10,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:10,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:10,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2261204] [2021-08-27 06:38:10,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2261204] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:10,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:10,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2021-08-27 06:38:10,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794676915] [2021-08-27 06:38:10,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:38:10,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:10,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:38:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:38:10,878 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:11,265 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2021-08-27 06:38:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:38:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:38:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:11,266 INFO L225 Difference]: With dead ends: 121 [2021-08-27 06:38:11,266 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 06:38:11,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 109.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:38:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 06:38:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2021-08-27 06:38:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 113 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2021-08-27 06:38:11,271 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 18 [2021-08-27 06:38:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:11,272 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2021-08-27 06:38:11,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2021-08-27 06:38:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:38:11,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:11,273 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:11,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:11,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:11,482 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1419700134, now seen corresponding path program 1 times [2021-08-27 06:38:11,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:11,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770890792] [2021-08-27 06:38:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:11,483 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:11,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:11,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:38:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:11,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:38:11,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:11,701 INFO L388 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 [2021-08-27 06:38:11,762 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:38:11,762 INFO L388 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 24 treesize of output 31 [2021-08-27 06:38:11,821 INFO L388 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 24 treesize of output 20 [2021-08-27 06:38:11,965 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:11,966 INFO L388 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 43 treesize of output 33 [2021-08-27 06:38:12,060 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:12,061 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2021-08-27 06:38:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:12,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:18,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:18,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770890792] [2021-08-27 06:38:18,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770890792] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:18,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:18,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:38:18,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069523381] [2021-08-27 06:38:18,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:38:18,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:38:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=134, Unknown=3, NotChecked=0, Total=182 [2021-08-27 06:38:18,912 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:22,705 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2021-08-27 06:38:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:38:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:38:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:22,707 INFO L225 Difference]: With dead ends: 127 [2021-08-27 06:38:22,707 INFO L226 Difference]: Without dead ends: 127 [2021-08-27 06:38:22,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 7113.9ms TimeCoverageRelationStatistics Valid=157, Invalid=392, Unknown=3, NotChecked=0, Total=552 [2021-08-27 06:38:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-27 06:38:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2021-08-27 06:38:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 112 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2021-08-27 06:38:22,711 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 19 [2021-08-27 06:38:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:22,711 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2021-08-27 06:38:22,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2021-08-27 06:38:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:38:22,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:22,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:22,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-08-27 06:38:22,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:22,923 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:38:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1419700135, now seen corresponding path program 1 times [2021-08-27 06:38:22,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:22,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513708288] [2021-08-27 06:38:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:22,924 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:22,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:22,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:38:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:23,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:38:23,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:23,155 INFO L388 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 [2021-08-27 06:38:23,197 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:38:23,198 INFO L388 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 18 treesize of output 18 [2021-08-27 06:38:23,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:23,235 INFO L388 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 21 treesize of output 17 [2021-08-27 06:38:23,244 INFO L388 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 [2021-08-27 06:38:23,356 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:23,357 INFO L388 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 67 treesize of output 49 [2021-08-27 06:38:23,376 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:38:23,377 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:38:23,478 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:23,479 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:38:23,485 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:23,488 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:38:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:23,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:38:35,835 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:35,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513708288] [2021-08-27 06:38:35,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513708288] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:38:35,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:38:35,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-27 06:38:35,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038302719] [2021-08-27 06:38:35,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:38:35,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:38:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:38:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=195, Unknown=2, NotChecked=0, Total=240 [2021-08-27 06:38:35,837 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:07,991 WARN L207 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2021-08-27 06:39:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:12,534 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2021-08-27 06:39:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:39:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:39:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:12,537 INFO L225 Difference]: With dead ends: 124 [2021-08-27 06:39:12,537 INFO L226 Difference]: Without dead ends: 124 [2021-08-27 06:39:12,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 46912.9ms TimeCoverageRelationStatistics Valid=272, Invalid=840, Unknown=10, NotChecked=0, Total=1122 [2021-08-27 06:39:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-27 06:39:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2021-08-27 06:39:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 108 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2021-08-27 06:39:12,540 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 19 [2021-08-27 06:39:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:12,540 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2021-08-27 06:39:12,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2021-08-27 06:39:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:39:12,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:12,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:12,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:12,742 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash -937860754, now seen corresponding path program 1 times [2021-08-27 06:39:12,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:12,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550102945] [2021-08-27 06:39:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:12,743 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:12,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:39:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:12,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:39:12,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:13,050 INFO L388 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 29 treesize of output 21 [2021-08-27 06:39:13,055 INFO L388 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 [2021-08-27 06:39:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:13,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:13,281 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:13,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550102945] [2021-08-27 06:39:13,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550102945] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:13,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:13,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-08-27 06:39:13,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219231620] [2021-08-27 06:39:13,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:39:13,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:39:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:39:13,283 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:13,653 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2021-08-27 06:39:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:39:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:39:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:13,655 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:39:13,655 INFO L226 Difference]: Without dead ends: 176 [2021-08-27 06:39:13,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-27 06:39:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2021-08-27 06:39:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 120 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2021-08-27 06:39:13,658 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 22 [2021-08-27 06:39:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:13,658 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2021-08-27 06:39:13,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2021-08-27 06:39:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:39:13,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:13,659 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:13,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:13,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:13,861 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -359370924, now seen corresponding path program 1 times [2021-08-27 06:39:13,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:13,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247887159] [2021-08-27 06:39:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:13,862 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:13,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:13,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:39:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:14,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:39:14,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:14,147 INFO L388 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 [2021-08-27 06:39:14,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:14,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2021-08-27 06:39:14,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:14,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:39:14,238 INFO L388 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 [2021-08-27 06:39:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:14,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:14,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:14,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247887159] [2021-08-27 06:39:14,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247887159] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:14,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:14,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2021-08-27 06:39:14,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549913526] [2021-08-27 06:39:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:39:14,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:39:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:14,409 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:15,189 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2021-08-27 06:39:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:39:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:39:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:15,191 INFO L225 Difference]: With dead ends: 155 [2021-08-27 06:39:15,191 INFO L226 Difference]: Without dead ends: 155 [2021-08-27 06:39:15,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 160.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:39:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-27 06:39:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2021-08-27 06:39:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 123 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2021-08-27 06:39:15,195 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 22 [2021-08-27 06:39:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:15,195 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2021-08-27 06:39:15,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2021-08-27 06:39:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:39:15,196 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:15,196 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:39:15,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:15,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:15,404 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1742772450, now seen corresponding path program 1 times [2021-08-27 06:39:15,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:15,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772360411] [2021-08-27 06:39:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:15,405 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:15,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:15,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:39:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:15,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:39:15,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:15,681 INFO L388 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 [2021-08-27 06:39:15,730 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:39:15,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2021-08-27 06:39:15,791 INFO L388 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 33 treesize of output 29 [2021-08-27 06:39:15,836 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:39:15,837 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2021-08-27 06:39:16,056 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:39:16,057 INFO L388 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 60 treesize of output 46 [2021-08-27 06:39:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:16,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:16,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:16,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772360411] [2021-08-27 06:39:16,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772360411] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:16,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:16,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2021-08-27 06:39:16,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125667353] [2021-08-27 06:39:16,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:39:16,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:16,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:39:16,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:39:16,402 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:17,814 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2021-08-27 06:39:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:39:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:39:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:17,816 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:39:17,816 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:39:17,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 617.0ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:39:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:39:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2021-08-27 06:39:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 127 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2021-08-27 06:39:17,819 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 23 [2021-08-27 06:39:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:17,820 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2021-08-27 06:39:17,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2021-08-27 06:39:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:39:17,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:17,821 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:39:17,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:18,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:18,029 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1742772451, now seen corresponding path program 1 times [2021-08-27 06:39:18,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:18,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815985516] [2021-08-27 06:39:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:18,030 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:18,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:18,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:39:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:18,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:39:18,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:18,377 INFO L388 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 [2021-08-27 06:39:18,441 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:39:18,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:39:18,500 INFO L388 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 17 treesize of output 13 [2021-08-27 06:39:18,507 INFO L388 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 [2021-08-27 06:39:18,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:18,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:39:18,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:18,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:39:18,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:39:18,809 INFO L388 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 1 case distinctions, treesize of input 50 treesize of output 38 [2021-08-27 06:39:18,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:39:18,814 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 20 [2021-08-27 06:39:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:18,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:19,571 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:19,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815985516] [2021-08-27 06:39:19,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815985516] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:19,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:19,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2021-08-27 06:39:19,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700855006] [2021-08-27 06:39:19,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:39:19,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:39:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:19,573 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:21,828 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2021-08-27 06:39:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:39:21,830 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:39:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:21,831 INFO L225 Difference]: With dead ends: 190 [2021-08-27 06:39:21,831 INFO L226 Difference]: Without dead ends: 190 [2021-08-27 06:39:21,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 924.3ms TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:39:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-08-27 06:39:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 133. [2021-08-27 06:39:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.411214953271028) internal successors, (151), 129 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2021-08-27 06:39:21,835 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 23 [2021-08-27 06:39:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:21,835 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2021-08-27 06:39:21,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2021-08-27 06:39:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:39:21,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:21,836 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:39:21,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:22,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:22,046 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -232916121, now seen corresponding path program 1 times [2021-08-27 06:39:22,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:22,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953438241] [2021-08-27 06:39:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:22,047 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:22,048 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:39:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:22,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 06:39:22,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:22,411 INFO L388 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 [2021-08-27 06:39:22,450 INFO L388 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 [2021-08-27 06:39:22,526 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:39:22,527 INFO L388 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 18 treesize of output 18 [2021-08-27 06:39:22,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:39:22,624 INFO L388 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 [2021-08-27 06:39:22,633 INFO L388 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 43 treesize of output 39 [2021-08-27 06:39:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:22,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:39:22,644 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:22,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 06:39:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:22,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:39:22,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:22,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2021-08-27 06:39:22,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:22,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:22,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:39:22,712 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:22,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 49 treesize of output 36 [2021-08-27 06:39:22,893 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:39:22,894 INFO L388 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 1 case distinctions, treesize of input 54 treesize of output 42 [2021-08-27 06:39:22,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:39:22,901 INFO L388 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 1 case distinctions, treesize of input 36 treesize of output 24 [2021-08-27 06:39:23,016 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:39:23,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-08-27 06:39:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:23,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:23,339 INFO L388 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 47 treesize of output 45 [2021-08-27 06:39:23,345 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-08-27 06:39:23,354 INFO L388 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 35 treesize of output 33 [2021-08-27 06:39:25,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_main_~x~0.base_103 (_ BitVec 32))) (or (not (= (_ bv1 32) (select (select (store |c_#memory_int| v_main_~x~0.base_103 (store (store (store (select |c_#memory_int| v_main_~x~0.base_103) (_ bv8 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_6) (_ bv4 32) v_DerPreprocessor_5)) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))))) (not (= (_ bv0 1) (select |c_#valid| v_main_~x~0.base_103))))) is different from false [2021-08-27 06:39:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:25,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:25,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953438241] [2021-08-27 06:39:25,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953438241] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:25,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:25,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-27 06:39:25,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329394638] [2021-08-27 06:39:25,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:39:25,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:39:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2021-08-27 06:39:25,988 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,435 WARN L207 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2021-08-27 06:39:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:55,434 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2021-08-27 06:39:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:39:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:39:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:55,436 INFO L225 Difference]: With dead ends: 197 [2021-08-27 06:39:55,436 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 06:39:55,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 29436.9ms TimeCoverageRelationStatistics Valid=155, Invalid=770, Unknown=9, NotChecked=58, Total=992 [2021-08-27 06:39:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 06:39:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 145. [2021-08-27 06:39:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 141 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2021-08-27 06:39:55,440 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 25 [2021-08-27 06:39:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:55,441 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2021-08-27 06:39:55,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2021-08-27 06:39:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:39:55,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:55,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:55,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:55,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:55,652 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr58ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:55,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1368706167, now seen corresponding path program 1 times [2021-08-27 06:39:55,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:55,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445879778] [2021-08-27 06:39:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:55,653 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:55,654 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:39:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:55,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:39:55,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:56,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:56,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445879778] [2021-08-27 06:39:56,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445879778] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:56,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:56,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:39:56,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41455150] [2021-08-27 06:39:56,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:56,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:56,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:56,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:56,149 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:56,415 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2021-08-27 06:39:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 06:39:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:56,417 INFO L225 Difference]: With dead ends: 170 [2021-08-27 06:39:56,417 INFO L226 Difference]: Without dead ends: 170 [2021-08-27 06:39:56,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:39:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-27 06:39:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2021-08-27 06:39:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 141 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2021-08-27 06:39:56,421 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 26 [2021-08-27 06:39:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:56,421 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2021-08-27 06:39:56,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2021-08-27 06:39:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:39:56,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:56,423 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:56,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:56,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:56,629 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:56,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash 957496094, now seen corresponding path program 1 times [2021-08-27 06:39:56,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:56,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658267145] [2021-08-27 06:39:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:56,630 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:56,631 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:56,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:39:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:57,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:39:57,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:57,118 INFO L388 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 [2021-08-27 06:39:57,165 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 06:39:57,166 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:39:57,218 INFO L388 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 19 treesize of output 7 [2021-08-27 06:39:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:57,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:57,311 INFO L388 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 83 treesize of output 77 [2021-08-27 06:39:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:57,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:57,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658267145] [2021-08-27 06:39:57,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658267145] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:57,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:57,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2021-08-27 06:39:57,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695820187] [2021-08-27 06:39:57,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:39:57,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:39:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:57,415 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:58,040 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2021-08-27 06:39:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:39:58,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:39:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:58,041 INFO L225 Difference]: With dead ends: 193 [2021-08-27 06:39:58,042 INFO L226 Difference]: Without dead ends: 193 [2021-08-27 06:39:58,042 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.7ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-27 06:39:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2021-08-27 06:39:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 146 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2021-08-27 06:39:58,046 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 27 [2021-08-27 06:39:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:58,046 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2021-08-27 06:39:58,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2021-08-27 06:39:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:39:58,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:58,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:58,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:58,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:39:58,257 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:39:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash -384022952, now seen corresponding path program 1 times [2021-08-27 06:39:58,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:39:58,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398266127] [2021-08-27 06:39:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:58,258 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:39:58,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:39:58,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:39:58,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:39:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:58,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:39:58,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:58,756 INFO L388 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 [2021-08-27 06:39:58,765 INFO L388 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 [2021-08-27 06:39:58,878 INFO L388 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 [2021-08-27 06:39:58,885 INFO L388 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 [2021-08-27 06:39:58,960 INFO L388 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 29 treesize of output 21 [2021-08-27 06:39:58,965 INFO L388 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 [2021-08-27 06:39:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:59,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:59,068 INFO L388 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 28 treesize of output 24 [2021-08-27 06:39:59,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:59,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:59,253 INFO L388 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 8 treesize of output 4 [2021-08-27 06:39:59,259 INFO L388 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 8 treesize of output 4 [2021-08-27 06:39:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:59,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:59,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398266127] [2021-08-27 06:39:59,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398266127] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:59,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:59,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 12 [2021-08-27 06:39:59,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916478431] [2021-08-27 06:39:59,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:39:59,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:39:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:39:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:39:59,292 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:00,406 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2021-08-27 06:40:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:40:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:40:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:00,408 INFO L225 Difference]: With dead ends: 188 [2021-08-27 06:40:00,408 INFO L226 Difference]: Without dead ends: 188 [2021-08-27 06:40:00,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 268.8ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:40:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-27 06:40:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2021-08-27 06:40:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 152 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2021-08-27 06:40:00,412 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 28 [2021-08-27 06:40:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2021-08-27 06:40:00,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2021-08-27 06:40:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:40:00,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:00,414 INFO L512 BasicCegarLoop]: 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] [2021-08-27 06:40:00,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:40:00,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:40:00,624 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 54 more)] === [2021-08-27 06:40:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1881186989, now seen corresponding path program 1 times [2021-08-27 06:40:00,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:40:00,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116638024] [2021-08-27 06:40:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:00,626 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:40:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:40:00,626 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:40:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:40:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:01,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 06:40:01,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:01,107 INFO L388 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 [2021-08-27 06:40:01,112 INFO L388 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 [2021-08-27 06:40:01,138 INFO L388 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 [2021-08-27 06:40:01,144 INFO L388 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 [2021-08-27 06:40:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:40:01,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:40:01,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:01,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:01,411 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:40:01,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:40:01,442 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:40:01,443 INFO L388 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 17 treesize of output 17 [2021-08-27 06:40:01,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,528 INFO L388 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 36 treesize of output 23 [2021-08-27 06:40:01,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:01,553 INFO L388 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 36 treesize of output 23 [2021-08-27 06:40:01,610 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-08-27 06:40:01,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 60 treesize of output 62 [2021-08-27 06:40:01,636 INFO L354 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2021-08-27 06:40:01,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 73 treesize of output 75 [2021-08-27 06:40:01,769 INFO L354 Elim1Store]: treesize reduction 100, result has 18.0 percent of original size [2021-08-27 06:40:01,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 83 [2021-08-27 06:40:01,809 INFO L354 Elim1Store]: treesize reduction 132, result has 18.5 percent of original size [2021-08-27 06:40:01,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 96 [2021-08-27 06:40:03,084 INFO L354 Elim1Store]: treesize reduction 102, result has 2.9 percent of original size [2021-08-27 06:40:03,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 89 [2021-08-27 06:40:03,110 INFO L354 Elim1Store]: treesize reduction 102, result has 2.9 percent of original size [2021-08-27 06:40:03,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 55 [2021-08-27 06:40:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:40:03,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:30,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:40:30,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116638024] [2021-08-27 06:40:30,192 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:40:30,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473562180] [2021-08-27 06:40:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:30,192 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:40:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:40:30,204 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:40:30,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-08-27 06:40:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:30,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 06:40:30,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:30,872 INFO L388 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 [2021-08-27 06:40:30,975 INFO L388 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 [2021-08-27 06:40:30,983 INFO L388 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 [2021-08-27 06:40:31,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:40:31,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:40:31,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:31,362 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:40:31,362 INFO L388 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 18 treesize of output 18 [2021-08-27 06:40:31,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,510 INFO L388 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 36 treesize of output 23 [2021-08-27 06:40:31,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,521 INFO L388 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 36 treesize of output 23 [2021-08-27 06:40:31,572 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 06:40:31,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 57 [2021-08-27 06:40:31,585 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 06:40:31,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 66 [2021-08-27 06:40:31,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:40:31,752 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:40:31,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 78 [2021-08-27 06:40:31,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:31,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:40:31,772 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-08-27 06:40:31,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 87 [2021-08-27 06:40:32,926 INFO L354 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2021-08-27 06:40:32,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 62 [2021-08-27 06:40:32,947 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-08-27 06:40:32,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 29 [2021-08-27 06:40:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:40:32,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:37,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.base_125 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_main_~x~0.base_125))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse0 (store (store (store (select |c_#memory_$Pointer$.base| v_main_~x~0.base_125) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) c_main_~head~0.base) (_ bv4 32) (_ bv0 32)))) (select (store |c_#memory_$Pointer$.base| v_main_~x~0.base_125 .cse0) (select .cse0 (_ bv0 32)))) (select (store (store (store (select |c_#memory_$Pointer$.offset| v_main_~x~0.base_125) (_ bv8 32) v_DerPreprocessor_10) (_ bv0 32) c_main_~head~0.offset) (_ bv4 32) (_ bv0 32)) (_ bv0 32))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse1 (store (store (store (select |c_#memory_$Pointer$.offset| v_main_~x~0.base_125) (_ bv8 32) v_DerPreprocessor_10) (_ bv0 32) c_main_~head~0.offset) (_ bv4 32) (_ bv0 32)))) (select (select (store |c_#memory_$Pointer$.offset| v_main_~x~0.base_125 .cse1) (select (store (store (store (select |c_#memory_$Pointer$.base| v_main_~x~0.base_125) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) c_main_~head~0.base) (_ bv4 32) (_ bv0 32)) (_ bv0 32))) (select .cse1 (_ bv0 32))))))))) is different from false [2021-08-27 06:40:37,167 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:40:37,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156883702] [2021-08-27 06:40:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:37,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:40:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:37,169 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:40:37,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 06:40:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:37,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:40:37,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:37,770 INFO L388 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 [2021-08-27 06:40:37,780 INFO L388 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 [2021-08-27 06:40:37,945 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:40:37,946 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:40:37,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:37,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2021-08-27 06:40:38,185 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:40:38,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:38,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:38,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:38,308 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:40:38,308 INFO L388 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 23 treesize of output 23 [2021-08-27 06:40:38,538 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:40:38,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:40:38,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:40:38,552 INFO L388 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 36 treesize of output 23 [2021-08-27 06:40:38,613 INFO L354 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2021-08-27 06:40:38,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 59 treesize of output 61 [2021-08-27 06:40:38,667 INFO L354 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2021-08-27 06:40:38,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 64 treesize of output 66 [2021-08-27 06:40:38,968 INFO L354 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2021-08-27 06:40:38,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 91 [2021-08-27 06:40:39,036 INFO L354 Elim1Store]: treesize reduction 140, result has 17.6 percent of original size [2021-08-27 06:40:39,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 94 [2021-08-27 06:40:40,600 INFO L354 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2021-08-27 06:40:40,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 64 [2021-08-27 06:40:40,610 INFO L354 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2021-08-27 06:40:40,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 28 [2021-08-27 06:40:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:40:40,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:08,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.base_131 (_ BitVec 32))) (or (and (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (= (let ((.cse1 (bvadd (_ bv8 32) main_~x~0.offset)) (.cse2 (bvadd (_ bv4 32) main_~x~0.offset))) (select (let ((.cse0 (store (store (store (select |c_#memory_$Pointer$.base| v_main_~x~0.base_131) .cse1 v_DerPreprocessor_12) main_~x~0.offset c_main_~head~0.base) .cse2 (_ bv0 32)))) (select (store |c_#memory_$Pointer$.base| v_main_~x~0.base_131 .cse0) (select .cse0 main_~x~0.offset))) (select (store (store (store (select |c_#memory_$Pointer$.offset| v_main_~x~0.base_131) .cse1 v_DerPreprocessor_13) main_~x~0.offset c_main_~head~0.offset) .cse2 (_ bv0 32)) main_~x~0.offset))) (_ bv0 32))) (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (= (let ((.cse4 (bvadd (_ bv8 32) main_~x~0.offset)) (.cse5 (bvadd (_ bv4 32) main_~x~0.offset))) (let ((.cse3 (store (store (store (select |c_#memory_$Pointer$.offset| v_main_~x~0.base_131) .cse4 v_DerPreprocessor_13) main_~x~0.offset c_main_~head~0.offset) .cse5 (_ bv0 32)))) (select (select (store |c_#memory_$Pointer$.offset| v_main_~x~0.base_131 .cse3) (select (store (store (store (select |c_#memory_$Pointer$.base| v_main_~x~0.base_131) .cse4 v_DerPreprocessor_12) main_~x~0.offset c_main_~head~0.base) .cse5 (_ bv0 32)) main_~x~0.offset)) (select .cse3 main_~x~0.offset)))) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_main_~x~0.base_131))))) is different from false [2021-08-27 06:41:08,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:41:08,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:08,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:41:08,236 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:41:08,236 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:41:08,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:41:08,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:41:08,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:41:08,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:41:08,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:41:08,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:41:08,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:41:08,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 06:41:08,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:41:08,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 06:41:08,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:41:08,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:08,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:08,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:08,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:41:08,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-08-27 06:41:08,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:08,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-27 06:41:08,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:08,865 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:41:08,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:41:08 BoogieIcfgContainer [2021-08-27 06:41:08,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:41:08,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:41:08,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:41:08,887 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:41:08,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:38:03" (3/4) ... [2021-08-27 06:41:08,891 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:41:08,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:41:08,892 INFO L168 Benchmark]: Toolchain (without parser) took 186788.82 ms. Allocated memory was 67.1 MB in the beginning and 144.7 MB in the end (delta: 77.6 MB). Free memory was 45.2 MB in the beginning and 101.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:08,892 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.4 MB in the beginning and 47.4 MB in the end (delta: 39.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:41:08,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.33 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 41.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:08,893 INFO L168 Benchmark]: Boogie Preprocessor took 70.25 ms. Allocated memory is still 67.1 MB. Free memory was 41.3 MB in the beginning and 38.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:08,893 INFO L168 Benchmark]: RCFGBuilder took 990.32 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 38.2 MB in the beginning and 48.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:08,894 INFO L168 Benchmark]: TraceAbstraction took 185336.26 ms. Allocated memory was 81.8 MB in the beginning and 144.7 MB in the end (delta: 62.9 MB). Free memory was 47.6 MB in the beginning and 102.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:08,895 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 101.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:41:08,896 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.4 MB in the beginning and 47.4 MB in the end (delta: 39.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 380.33 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 41.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.25 ms. Allocated memory is still 67.1 MB. Free memory was 41.3 MB in the beginning and 38.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 990.32 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 38.2 MB in the beginning and 48.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 185336.26 ms. Allocated memory was 81.8 MB in the beginning and 144.7 MB in the end (delta: 62.9 MB). Free memory was 47.6 MB in the beginning and 102.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.62 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 101.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1000] SLL* head = malloc(sizeof(SLL)); [L1001] head->next = ((void*)0) [L1002] head->prev = ((void*)0) [L1003] head->data = 0 [L1005] SLL* x = head; [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1019] COND TRUE __VERIFIER_nondet_int() [L1020] x = malloc(sizeof(SLL)) [L1021] x->data = 1 [L1022] x->next = head [L1023] x->prev = ((void*)0) [L1024] head = x [L1049] x = head [L1052] EXPR x->data [L1052] COND FALSE !(x->data != 1) [L1058] EXPR x->next [L1058] x = x->next [L1059] COND TRUE \read(*x) [L1061] EXPR x->data [L1061] COND FALSE !(x->data == 1) [L1063] EXPR x->next [L1063] x = x->next [L1059] COND TRUE \read(*x) [L1061] x->data - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 135 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 185253.8ms, OverallIterations: 18, TraceHistogramMax: 2, EmptinessCheckTime: 31.6ms, AutomataDifference: 80104.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1159 SDtfs, 2324 SDslu, 2898 SDs, 0 SdLazy, 4877 SolverSat, 523 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14589.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 452 SyntacticMatches, 53 SemanticMatches, 195 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 86212.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=17, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 100.7ms AutomataMinimizationTime, 17 MinimizatonAttempts, 437 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 150.9ms SsaConstructionTime, 719.5ms SatisfiabilityAnalysisTime, 29254.3ms InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 606 ConstructedInterpolants, 46 QuantifiedInterpolants, 5824 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1897 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:41:08,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...