./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5fbdf5bf 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-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 635ef9d2e243ceee348a174080644f4e80f3ae61 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 16:03:09,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 16:03:09,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 16:03:09,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 16:03:09,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 16:03:09,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 16:03:09,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 16:03:09,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 16:03:09,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 16:03:09,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 16:03:09,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 16:03:09,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 16:03:09,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 16:03:09,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 16:03:09,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 16:03:09,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 16:03:09,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 16:03:09,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 16:03:09,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 16:03:09,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 16:03:09,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 16:03:09,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 16:03:09,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 16:03:09,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 16:03:09,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 16:03:09,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 16:03:09,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 16:03:09,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 16:03:09,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 16:03:09,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 16:03:09,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 16:03:09,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 16:03:09,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 16:03:09,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 16:03:09,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 16:03:09,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 16:03:09,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 16:03:09,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 16:03:09,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 16:03:09,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 16:03:09,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 16:03:09,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-30 16:03:09,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 16:03:09,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 16:03:09,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 16:03:09,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 16:03:09,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 16:03:09,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 16:03:09,340 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 16:03:09,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 16:03:09,341 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 16:03:09,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 16:03:09,342 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 16:03:09,343 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 16:03:09,343 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 16:03:09,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 16:03:09,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 16:03:09,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 16:03:09,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 16:03:09,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 16:03:09,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 16:03:09,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 16:03:09,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 16:03:09,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 16:03:09,344 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-memcleanup) ) 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 -> 635ef9d2e243ceee348a174080644f4e80f3ae61 [2021-08-30 16:03:09,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 16:03:09,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 16:03:09,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 16:03:09,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 16:03:09,659 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 16:03:09,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-08-30 16:03:09,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a748a3903/9107919b35744988a82584347140d066/FLAG7e147e3ca [2021-08-30 16:03:10,123 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 16:03:10,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-08-30 16:03:10,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a748a3903/9107919b35744988a82584347140d066/FLAG7e147e3ca [2021-08-30 16:03:10,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a748a3903/9107919b35744988a82584347140d066 [2021-08-30 16:03:10,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 16:03:10,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 16:03:10,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 16:03:10,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 16:03:10,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 16:03:10,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267b7b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10, skipping insertion in model container [2021-08-30 16:03:10,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 16:03:10,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 16:03:10,767 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-sorted-1.i[22384,22397] [2021-08-30 16:03:10,780 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-sorted-1.i[22614,22627] [2021-08-30 16:03:10,800 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-sorted-1.i[22989,23002] [2021-08-30 16:03:10,801 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-sorted-1.i[23053,23066] [2021-08-30 16:03:10,802 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-sorted-1.i[23184,23197] [2021-08-30 16:03:10,802 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-sorted-1.i[23248,23261] [2021-08-30 16:03:10,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 16:03:10,810 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 16:03:10,843 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-sorted-1.i[22384,22397] [2021-08-30 16:03:10,844 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-sorted-1.i[22614,22627] [2021-08-30 16:03:10,846 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-sorted-1.i[22989,23002] [2021-08-30 16:03:10,849 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-sorted-1.i[23053,23066] [2021-08-30 16:03:10,849 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-sorted-1.i[23184,23197] [2021-08-30 16:03:10,850 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-sorted-1.i[23248,23261] [2021-08-30 16:03:10,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 16:03:10,871 INFO L208 MainTranslator]: Completed translation [2021-08-30 16:03:10,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10 WrapperNode [2021-08-30 16:03:10,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 16:03:10,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 16:03:10,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 16:03:10,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 16:03:10,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 16:03:10,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 16:03:10,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 16:03:10,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 16:03:10,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (1/1) ... [2021-08-30 16:03:10,964 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 16:03:10,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:03:10,981 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-30 16:03:11,000 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-30 16:03:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 16:03:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 16:03:11,015 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-30 16:03:11,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 16:03:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 16:03:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 16:03:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 16:03:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 16:03:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 16:03:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 16:03:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 16:03:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 16:03:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 16:03:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 16:03:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 16:03:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 16:03:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 16:03:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 16:03:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 16:03:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 16:03:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 16:03:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-30 16:03:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 16:03:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 16:03:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 16:03:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 16:03:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 16:03:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 16:03:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 16:03:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 16:03:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 16:03:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 16:03:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 16:03:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 16:03:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 16:03:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-30 16:03:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-30 16:03:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-30 16:03:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-30 16:03:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 16:03:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 16:03:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 16:03:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 16:03:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 16:03:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 16:03:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 16:03:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 16:03:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 16:03:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-30 16:03:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 16:03:11,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 16:03:11,367 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-30 16:03:11,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:03:11 BoogieIcfgContainer [2021-08-30 16:03:11,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 16:03:11,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 16:03:11,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 16:03:11,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 16:03:11,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:03:10" (1/3) ... [2021-08-30 16:03:11,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562634ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:03:11, skipping insertion in model container [2021-08-30 16:03:11,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:03:10" (2/3) ... [2021-08-30 16:03:11,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562634ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:03:11, skipping insertion in model container [2021-08-30 16:03:11,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:03:11" (3/3) ... [2021-08-30 16:03:11,373 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2021-08-30 16:03:11,377 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 16:03:11,377 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-08-30 16:03:11,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 16:03:11,434 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-30 16:03:11,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-08-30 16:03:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 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-30 16:03:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-30 16:03:11,462 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:11,462 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:11,463 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346321, now seen corresponding path program 1 times [2021-08-30 16:03:11,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:11,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617761428] [2021-08-30 16:03:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:11,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:11,693 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-30 16:03:11,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:11,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617761428] [2021-08-30 16:03:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617761428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:11,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:11,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 16:03:11,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484842568] [2021-08-30 16:03:11,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 16:03:11,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:11,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 16:03:11,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:11,723 INFO L87 Difference]: Start difference. First operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 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-30 16:03:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:12,064 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2021-08-30 16:03:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 16:03:12,066 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-30 16:03:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:12,072 INFO L225 Difference]: With dead ends: 186 [2021-08-30 16:03:12,072 INFO L226 Difference]: Without dead ends: 182 [2021-08-30 16:03:12,073 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.20ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:12,075 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 171 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 235.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.99ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 304.82ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:12,076 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 8 Invalid, 401 Unknown, 0 Unchecked, 4.99ms Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 304.82ms Time] [2021-08-30 16:03:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-30 16:03:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2021-08-30 16:03:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 98 states have (on average 1.8979591836734695) internal successors, (186), 174 states have internal predecessors, (186), 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-30 16:03:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2021-08-30 16:03:12,105 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 7 [2021-08-30 16:03:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:12,105 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2021-08-30 16:03:12,106 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-30 16:03:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2021-08-30 16:03:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-30 16:03:12,106 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:12,106 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:12,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 16:03:12,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346320, now seen corresponding path program 1 times [2021-08-30 16:03:12,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:12,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041852725] [2021-08-30 16:03:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:12,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,156 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-30 16:03:12,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:12,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041852725] [2021-08-30 16:03:12,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041852725] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:12,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:12,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 16:03:12,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269743283] [2021-08-30 16:03:12,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 16:03:12,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 16:03:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:12,159 INFO L87 Difference]: Start difference. First operand 178 states and 189 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-30 16:03:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:12,403 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2021-08-30 16:03:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 16:03:12,404 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-30 16:03:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:12,405 INFO L225 Difference]: With dead ends: 179 [2021-08-30 16:03:12,405 INFO L226 Difference]: Without dead ends: 179 [2021-08-30 16:03:12,406 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.05ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:12,406 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 167 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 184.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.32ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 231.50ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:12,407 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 7 Invalid, 387 Unknown, 0 Unchecked, 2.32ms Time], IncrementalHoareTripleChecker [5 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 231.50ms Time] [2021-08-30 16:03:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-30 16:03:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2021-08-30 16:03:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.8673469387755102) internal successors, (183), 171 states have internal predecessors, (183), 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-30 16:03:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-08-30 16:03:12,425 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 7 [2021-08-30 16:03:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:12,426 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-08-30 16:03:12,426 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-30 16:03:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2021-08-30 16:03:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 16:03:12,426 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:12,426 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:12,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 16:03:12,427 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash -155484519, now seen corresponding path program 1 times [2021-08-30 16:03:12,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:12,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692996596] [2021-08-30 16:03:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:12,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,501 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-30 16:03:12,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:12,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692996596] [2021-08-30 16:03:12,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692996596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:12,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:12,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 16:03:12,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548711764] [2021-08-30 16:03:12,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 16:03:12,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 16:03:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 16:03:12,504 INFO L87 Difference]: Start difference. First operand 175 states and 186 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-30 16:03:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:12,862 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2021-08-30 16:03:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 16:03:12,862 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-30 16:03:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:12,864 INFO L225 Difference]: With dead ends: 289 [2021-08-30 16:03:12,864 INFO L226 Difference]: Without dead ends: 289 [2021-08-30 16:03:12,864 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.87ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 16:03:12,865 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 390 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 270.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.00ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 336.78ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:12,865 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 10 Invalid, 592 Unknown, 0 Unchecked, 3.00ms Time], IncrementalHoareTripleChecker [36 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 336.78ms Time] [2021-08-30 16:03:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-30 16:03:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2021-08-30 16:03:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 157 states have (on average 1.8535031847133758) internal successors, (291), 230 states have internal predecessors, (291), 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-30 16:03:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2021-08-30 16:03:12,874 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 13 [2021-08-30 16:03:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:12,874 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2021-08-30 16:03:12,874 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-30 16:03:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2021-08-30 16:03:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 16:03:12,875 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:12,875 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:12,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 16:03:12,875 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -155484520, now seen corresponding path program 1 times [2021-08-30 16:03:12,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:12,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668863394] [2021-08-30 16:03:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:12,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:12,928 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-30 16:03:12,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:12,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668863394] [2021-08-30 16:03:12,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668863394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:12,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:12,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 16:03:12,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220619390] [2021-08-30 16:03:12,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 16:03:12,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 16:03:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 16:03:12,930 INFO L87 Difference]: Start difference. First operand 234 states and 294 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-30 16:03:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:13,178 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2021-08-30 16:03:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 16:03:13,179 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-30 16:03:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:13,181 INFO L225 Difference]: With dead ends: 232 [2021-08-30 16:03:13,181 INFO L226 Difference]: Without dead ends: 232 [2021-08-30 16:03:13,181 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.49ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 16:03:13,182 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 286 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 183.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 230.59ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:13,183 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 10 Invalid, 436 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [43 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 230.59ms Time] [2021-08-30 16:03:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-30 16:03:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2021-08-30 16:03:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.612121212121212) internal successors, (266), 220 states have internal predecessors, (266), 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-30 16:03:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 269 transitions. [2021-08-30 16:03:13,190 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 269 transitions. Word has length 13 [2021-08-30 16:03:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:13,190 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 269 transitions. [2021-08-30 16:03:13,190 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-30 16:03:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 269 transitions. [2021-08-30 16:03:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 16:03:13,191 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:13,191 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:13,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 16:03:13,191 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 903211970, now seen corresponding path program 1 times [2021-08-30 16:03:13,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:13,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782995323] [2021-08-30 16:03:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:13,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,224 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-30 16:03:13,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:13,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782995323] [2021-08-30 16:03:13,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782995323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:13,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:13,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 16:03:13,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263350191] [2021-08-30 16:03:13,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 16:03:13,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 16:03:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:13,226 INFO L87 Difference]: Start difference. First operand 224 states and 269 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-30 16:03:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:13,447 INFO L93 Difference]: Finished difference Result 270 states and 319 transitions. [2021-08-30 16:03:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 16:03:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-08-30 16:03:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:13,449 INFO L225 Difference]: With dead ends: 270 [2021-08-30 16:03:13,449 INFO L226 Difference]: Without dead ends: 270 [2021-08-30 16:03:13,449 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.14ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:03:13,450 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 120 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 212.49ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:13,450 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 7 Invalid, 426 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 212.49ms Time] [2021-08-30 16:03:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-08-30 16:03:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2021-08-30 16:03:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 233 states have internal predecessors, (286), 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-30 16:03:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2021-08-30 16:03:13,455 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 15 [2021-08-30 16:03:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:13,456 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2021-08-30 16:03:13,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-30 16:03:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2021-08-30 16:03:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 16:03:13,456 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:13,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:13,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 16:03:13,457 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587218, now seen corresponding path program 1 times [2021-08-30 16:03:13,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:13,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175145377] [2021-08-30 16:03:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:13,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,499 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-30 16:03:13,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:13,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175145377] [2021-08-30 16:03:13,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175145377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:13,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:13,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 16:03:13,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74295349] [2021-08-30 16:03:13,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 16:03:13,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 16:03:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 16:03:13,501 INFO L87 Difference]: Start difference. First operand 237 states and 289 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-30 16:03:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:13,818 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2021-08-30 16:03:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 16:03:13,819 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-30 16:03:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:13,819 INFO L225 Difference]: With dead ends: 236 [2021-08-30 16:03:13,819 INFO L226 Difference]: Without dead ends: 236 [2021-08-30 16:03:13,820 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.74ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-30 16:03:13,821 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 240.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 296.57ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:13,822 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 808 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [3 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 296.57ms Time] [2021-08-30 16:03:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-08-30 16:03:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-08-30 16:03:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.5898876404494382) internal successors, (283), 232 states have internal predecessors, (283), 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-30 16:03:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-08-30 16:03:13,826 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 16 [2021-08-30 16:03:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:13,826 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-08-30 16:03:13,826 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-30 16:03:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-08-30 16:03:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 16:03:13,827 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:13,827 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:03:13,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-30 16:03:13,827 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587217, now seen corresponding path program 1 times [2021-08-30 16:03:13,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:13,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601124143] [2021-08-30 16:03:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:13,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:13,888 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-30 16:03:13,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:13,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601124143] [2021-08-30 16:03:13,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601124143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:13,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:13,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 16:03:13,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480041149] [2021-08-30 16:03:13,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 16:03:13,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 16:03:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 16:03:13,891 INFO L87 Difference]: Start difference. First operand 236 states and 286 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-30 16:03:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:14,214 INFO L93 Difference]: Finished difference Result 235 states and 283 transitions. [2021-08-30 16:03:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 16:03:14,215 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-30 16:03:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:14,216 INFO L225 Difference]: With dead ends: 235 [2021-08-30 16:03:14,216 INFO L226 Difference]: Without dead ends: 235 [2021-08-30 16:03:14,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.67ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-30 16:03:14,217 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 242.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.56ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 298.95ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:14,217 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 808 Unknown, 0 Unchecked, 2.56ms Time], IncrementalHoareTripleChecker [2 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 298.95ms Time] [2021-08-30 16:03:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-08-30 16:03:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-08-30 16:03:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 231 states have internal predecessors, (280), 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-30 16:03:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2021-08-30 16:03:14,220 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 16 [2021-08-30 16:03:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:14,221 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2021-08-30 16:03:14,221 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-30 16:03:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2021-08-30 16:03:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 16:03:14,221 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:14,221 INFO L513 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-30 16:03:14,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-30 16:03:14,222 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash 949671408, now seen corresponding path program 1 times [2021-08-30 16:03:14,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:14,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501414366] [2021-08-30 16:03:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:14,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:14,306 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-30 16:03:14,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:14,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501414366] [2021-08-30 16:03:14,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501414366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:14,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:14,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-30 16:03:14,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275228188] [2021-08-30 16:03:14,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 16:03:14,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 16:03:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-30 16:03:14,308 INFO L87 Difference]: Start difference. First operand 235 states and 283 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-30 16:03:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:14,810 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2021-08-30 16:03:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 16:03:14,811 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-30 16:03:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:14,812 INFO L225 Difference]: With dead ends: 242 [2021-08-30 16:03:14,812 INFO L226 Difference]: Without dead ends: 242 [2021-08-30 16:03:14,812 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 89.56ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-30 16:03:14,813 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 288 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 354.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 432.71ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:14,813 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 25 Invalid, 1209 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [27 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 432.71ms Time] [2021-08-30 16:03:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-30 16:03:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2021-08-30 16:03:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.5617977528089888) internal successors, (278), 230 states have internal predecessors, (278), 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-30 16:03:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2021-08-30 16:03:14,818 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 20 [2021-08-30 16:03:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:14,818 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2021-08-30 16:03:14,818 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-30 16:03:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2021-08-30 16:03:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 16:03:14,818 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:14,818 INFO L513 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-30 16:03:14,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-30 16:03:14,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash 949671409, now seen corresponding path program 1 times [2021-08-30 16:03:14,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:14,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969670036] [2021-08-30 16:03:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:14,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:14,986 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-30 16:03:14,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:14,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969670036] [2021-08-30 16:03:14,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969670036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:14,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:14,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-30 16:03:14,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430216020] [2021-08-30 16:03:14,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 16:03:14,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 16:03:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-30 16:03:14,989 INFO L87 Difference]: Start difference. First operand 234 states and 281 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-30 16:03:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:15,600 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2021-08-30 16:03:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-30 16:03:15,601 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-30 16:03:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:15,602 INFO L225 Difference]: With dead ends: 237 [2021-08-30 16:03:15,602 INFO L226 Difference]: Without dead ends: 237 [2021-08-30 16:03:15,602 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 230.48ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-30 16:03:15,603 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 289 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 345.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.48ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 428.32ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:15,603 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 22 Invalid, 1066 Unknown, 0 Unchecked, 4.48ms Time], IncrementalHoareTripleChecker [35 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 428.32ms Time] [2021-08-30 16:03:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-08-30 16:03:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 220. [2021-08-30 16:03:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 216 states have internal predecessors, (260), 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-30 16:03:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2021-08-30 16:03:15,607 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 20 [2021-08-30 16:03:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:15,607 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2021-08-30 16:03:15,607 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-30 16:03:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2021-08-30 16:03:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 16:03:15,608 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:15,608 INFO L513 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] [2021-08-30 16:03:15,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-30 16:03:15,608 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1432225935, now seen corresponding path program 1 times [2021-08-30 16:03:15,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:15,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234590988] [2021-08-30 16:03:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:15,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:03:15,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:15,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234590988] [2021-08-30 16:03:15,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234590988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:03:15,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:03:15,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 16:03:15,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609105118] [2021-08-30 16:03:15,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 16:03:15,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 16:03:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 16:03:15,648 INFO L87 Difference]: Start difference. First operand 220 states and 263 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-30 16:03:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:15,886 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2021-08-30 16:03:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 16:03:15,887 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 29 [2021-08-30 16:03:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:15,888 INFO L225 Difference]: With dead ends: 258 [2021-08-30 16:03:15,888 INFO L226 Difference]: Without dead ends: 258 [2021-08-30 16:03:15,888 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.30ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 16:03:15,888 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 296 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 180.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 224.57ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:15,889 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 10 Invalid, 481 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [11 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 224.57ms Time] [2021-08-30 16:03:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-08-30 16:03:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2021-08-30 16:03:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.514792899408284) internal successors, (256), 214 states have internal predecessors, (256), 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-30 16:03:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2021-08-30 16:03:15,892 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 29 [2021-08-30 16:03:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:15,892 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2021-08-30 16:03:15,892 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-30 16:03:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2021-08-30 16:03:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-30 16:03:15,893 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:15,893 INFO L513 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] [2021-08-30 16:03:15,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-30 16:03:15,893 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077152, now seen corresponding path program 1 times [2021-08-30 16:03:15,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:15,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654481499] [2021-08-30 16:03:15,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:15,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:16,070 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-30 16:03:16,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:16,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654481499] [2021-08-30 16:03:16,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654481499] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 16:03:16,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624930742] [2021-08-30 16:03:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:16,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:03:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:03:16,093 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-30 16:03:16,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-30 16:03:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:16,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 16:03:16,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 16:03:16,254 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-30 16:03:16,358 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-30 16:03:16,358 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-30 16:03:16,409 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-30 16:03:16,562 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 16:03:16,562 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-30 16:03:16,764 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-30 16:03:16,765 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 49 treesize of output 48 [2021-08-30 16:03:16,881 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-30 16:03:16,882 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 60 treesize of output 45 [2021-08-30 16:03:17,087 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-30 16:03:17,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 33 [2021-08-30 16:03:17,115 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-30 16:03:17,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 16:03:42,986 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 11577 treesize of output 11513 [2021-08-30 16:03:43,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-30 16:03:43,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 16:03:43,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-08-30 16:03:43,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316902519] [2021-08-30 16:03:43,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 16:03:43,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 16:03:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1014, Unknown=12, NotChecked=0, Total=1190 [2021-08-30 16:03:43,063 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-30 16:03:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:44,186 INFO L93 Difference]: Finished difference Result 424 states and 481 transitions. [2021-08-30 16:03:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 16:03:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-30 16:03:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:44,188 INFO L225 Difference]: With dead ends: 424 [2021-08-30 16:03:44,188 INFO L226 Difference]: Without dead ends: 424 [2021-08-30 16:03:44,189 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 26308.68ms TimeCoverageRelationStatistics Valid=366, Invalid=2378, Unknown=12, NotChecked=0, Total=2756 [2021-08-30 16:03:44,189 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 699 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 587.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.19ms SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 719.21ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:44,189 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 25 Invalid, 1591 Unknown, 0 Unchecked, 5.19ms Time], IncrementalHoareTripleChecker [88 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 719.21ms Time] [2021-08-30 16:03:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-08-30 16:03:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 243. [2021-08-30 16:03:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 239 states have internal predecessors, (286), 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-30 16:03:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2021-08-30 16:03:44,193 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 35 [2021-08-30 16:03:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:44,194 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2021-08-30 16:03:44,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-30 16:03:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2021-08-30 16:03:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-30 16:03:44,194 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:44,194 INFO L513 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] [2021-08-30 16:03:44,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-30 16:03:44,404 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,SelfDestructingSolverStorable10 [2021-08-30 16:03:44,405 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077151, now seen corresponding path program 1 times [2021-08-30 16:03:44,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:44,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946542152] [2021-08-30 16:03:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:44,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:44,652 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-30 16:03:44,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:44,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946542152] [2021-08-30 16:03:44,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946542152] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 16:03:44,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420552848] [2021-08-30 16:03:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:44,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:03:44,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:03:44,653 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-30 16:03:44,654 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-30 16:03:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:44,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-30 16:03:44,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 16:03:44,912 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-30 16:03:44,913 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 19 treesize of output 26 [2021-08-30 16:03:44,928 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-30 16:03:44,929 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 19 treesize of output 18 [2021-08-30 16:03:45,078 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-30 16:03:45,078 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 90 [2021-08-30 16:03:45,097 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-08-30 16:03:45,097 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 87 treesize of output 66 [2021-08-30 16:03:45,574 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-08-30 16:03:45,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 81 [2021-08-30 16:03:45,584 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-30 16:03:45,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 47 [2021-08-30 16:03:45,618 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-30 16:03:45,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 16:03:46,029 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 16:03:46,030 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 94 treesize of output 98 [2021-08-30 16:03:47,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 16:03:47,805 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 393 treesize of output 308 [2021-08-30 16:03:47,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 16:03:47,816 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 490 treesize of output 361 [2021-08-30 16:03:48,355 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-30 16:03:48,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420552848] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 16:03:48,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 16:03:48,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2021-08-30 16:03:48,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23359478] [2021-08-30 16:03:48,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-30 16:03:48,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:03:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-30 16:03:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2021-08-30 16:03:48,358 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand has 36 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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-30 16:03:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:03:52,748 INFO L93 Difference]: Finished difference Result 583 states and 675 transitions. [2021-08-30 16:03:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-30 16:03:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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 35 [2021-08-30 16:03:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:03:52,750 INFO L225 Difference]: With dead ends: 583 [2021-08-30 16:03:52,751 INFO L226 Difference]: Without dead ends: 583 [2021-08-30 16:03:52,752 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 3361.69ms TimeCoverageRelationStatistics Valid=1185, Invalid=5295, Unknown=0, NotChecked=0, Total=6480 [2021-08-30 16:03:52,752 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 1617 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1453.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.52ms SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1370 IncrementalHoareTripleChecker+Unchecked, 1742.34ms IncrementalHoareTripleChecker+Time [2021-08-30 16:03:52,753 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 61 Invalid, 4828 Unknown, 0 Unchecked, 13.52ms Time], IncrementalHoareTripleChecker [228 Valid, 3230 Invalid, 0 Unknown, 1370 Unchecked, 1742.34ms Time] [2021-08-30 16:03:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-08-30 16:03:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 318. [2021-08-30 16:03:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 269 states have (on average 1.5092936802973977) internal successors, (406), 314 states have internal predecessors, (406), 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-30 16:03:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 409 transitions. [2021-08-30 16:03:52,758 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 409 transitions. Word has length 35 [2021-08-30 16:03:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:03:52,758 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 409 transitions. [2021-08-30 16:03:52,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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-30 16:03:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 409 transitions. [2021-08-30 16:03:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 16:03:52,759 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:03:52,759 INFO L513 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, 1, 1] [2021-08-30 16:03:52,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-30 16:03:52,970 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,SelfDestructingSolverStorable11 [2021-08-30 16:03:52,970 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:03:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:03:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295850, now seen corresponding path program 1 times [2021-08-30 16:03:52,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:03:52,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633817446] [2021-08-30 16:03:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:52,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:03:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:53,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:03:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:53,247 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-30 16:03:53,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:03:53,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633817446] [2021-08-30 16:03:53,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633817446] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 16:03:53,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123301777] [2021-08-30 16:03:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:03:53,247 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:03:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:03:53,248 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-30 16:03:53,249 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-30 16:03:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:03:53,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-30 16:03:53,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 16:03:53,351 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-30 16:03:53,419 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 16:03:53,419 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-30 16:03:53,446 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-30 16:03:53,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-30 16:03:53,513 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 16:03:53,513 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-30 16:03:53,520 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-30 16:03:53,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, 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-30 16:03:53,608 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-30 16:03:53,608 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 42 treesize of output 23 [2021-08-30 16:03:53,682 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-08-30 16:03:53,682 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 28 treesize of output 30 [2021-08-30 16:03:55,771 INFO L354 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2021-08-30 16:03:55,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 43 [2021-08-30 16:03:56,159 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 54 treesize of output 46 [2021-08-30 16:03:56,167 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-30 16:03:56,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 30 [2021-08-30 16:03:56,230 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-30 16:03:56,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 16:03:56,342 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 16:03:56,343 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 31 treesize of output 35 [2021-08-30 16:04:27,796 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 2380 treesize of output 2372 [2021-08-30 16:08:01,276 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-30 16:08:01,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123301777] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 16:08:01,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 16:08:01,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 48 [2021-08-30 16:08:01,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755822711] [2021-08-30 16:08:01,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-08-30 16:08:01,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-08-30 16:08:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2117, Unknown=20, NotChecked=0, Total=2352 [2021-08-30 16:08:01,278 INFO L87 Difference]: Start difference. First operand 318 states and 409 transitions. Second operand has 49 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 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-30 16:08:01,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_main_~head~0.base c_main_~x~0.base)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| c_main_~head~0.base) c_main_~head~0.offset) 0))) (and (= c_main_~head~0.offset 0) (or (and (not .cse0) .cse1) (= c_main_~marked~0 0)) (= (select |c_#valid| c_main_~head~0.base) 1) (forall ((v_main_~x~0.offset_79 Int)) (or (< c_main_~head~0.offset v_main_~x~0.offset_79) (< v_main_~x~0.offset_79 0) (<= 0 (select (select |c_#memory_$Pointer$.offset| c_main_~head~0.base) v_main_~x~0.offset_79)))) .cse0 (= c_main_~x~0.offset c_main_~head~0.offset) .cse1 (forall ((v_main_~x~0.offset_79 Int) (v_DerPreprocessor_4 Int)) (or (< c_main_~head~0.offset v_main_~x~0.offset_79) (< v_main_~x~0.offset_79 0) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) (+ c_main_~x~0.offset 8) v_DerPreprocessor_4)) c_main_~head~0.base) v_main_~x~0.offset_79)))) (= (select (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset) 0))) is different from false [2021-08-30 16:08:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:03,525 INFO L93 Difference]: Finished difference Result 361 states and 453 transitions. [2021-08-30 16:08:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-30 16:08:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 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 40 [2021-08-30 16:08:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:03,527 INFO L225 Difference]: With dead ends: 361 [2021-08-30 16:08:03,527 INFO L226 Difference]: Without dead ends: 361 [2021-08-30 16:08:03,528 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 34790.30ms TimeCoverageRelationStatistics Valid=376, Invalid=3029, Unknown=21, NotChecked=114, Total=3540 [2021-08-30 16:08:03,529 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 120 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1099.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.77ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1876 IncrementalHoareTripleChecker+Unchecked, 1370.29ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:03,529 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 88 Invalid, 5184 Unknown, 0 Unchecked, 9.77ms Time], IncrementalHoareTripleChecker [46 Valid, 3262 Invalid, 0 Unknown, 1876 Unchecked, 1370.29ms Time] [2021-08-30 16:08:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-08-30 16:08:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 305. [2021-08-30 16:08:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 301 states have internal predecessors, (385), 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-30 16:08:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 388 transitions. [2021-08-30 16:08:03,534 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 388 transitions. Word has length 40 [2021-08-30 16:08:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:03,535 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 388 transitions. [2021-08-30 16:08:03,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 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-30 16:08:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 388 transitions. [2021-08-30 16:08:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 16:08:03,539 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:03,539 INFO L513 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, 1, 1] [2021-08-30 16:08:03,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-30 16:08:03,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:08:03,753 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295851, now seen corresponding path program 1 times [2021-08-30 16:08:03,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:03,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570435914] [2021-08-30 16:08:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:03,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:03,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:03,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570435914] [2021-08-30 16:08:03,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570435914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:03,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:08:03,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 16:08:03,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881281036] [2021-08-30 16:08:03,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 16:08:03,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 16:08:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-30 16:08:03,846 INFO L87 Difference]: Start difference. First operand 305 states and 388 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-30 16:08:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:04,250 INFO L93 Difference]: Finished difference Result 339 states and 429 transitions. [2021-08-30 16:08:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 16:08:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 40 [2021-08-30 16:08:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:04,251 INFO L225 Difference]: With dead ends: 339 [2021-08-30 16:08:04,251 INFO L226 Difference]: Without dead ends: 339 [2021-08-30 16:08:04,251 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 60.18ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-30 16:08:04,252 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 113 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 305.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 371.55ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:04,252 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 16 Invalid, 916 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [12 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 371.55ms Time] [2021-08-30 16:08:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-30 16:08:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 309. [2021-08-30 16:08:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 267 states have (on average 1.4644194756554307) internal successors, (391), 305 states have internal predecessors, (391), 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-30 16:08:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 394 transitions. [2021-08-30 16:08:04,257 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 394 transitions. Word has length 40 [2021-08-30 16:08:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:04,257 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 394 transitions. [2021-08-30 16:08:04,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-30 16:08:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 394 transitions. [2021-08-30 16:08:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 16:08:04,257 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:04,257 INFO L513 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, 1, 1] [2021-08-30 16:08:04,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-30 16:08:04,258 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash -371074441, now seen corresponding path program 1 times [2021-08-30 16:08:04,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:04,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300517096] [2021-08-30 16:08:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:04,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:04,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:04,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300517096] [2021-08-30 16:08:04,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300517096] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:04,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:08:04,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-30 16:08:04,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063513112] [2021-08-30 16:08:04,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 16:08:04,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:04,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 16:08:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-30 16:08:04,364 INFO L87 Difference]: Start difference. First operand 309 states and 394 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-30 16:08:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:04,812 INFO L93 Difference]: Finished difference Result 326 states and 413 transitions. [2021-08-30 16:08:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 16:08:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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 40 [2021-08-30 16:08:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:04,813 INFO L225 Difference]: With dead ends: 326 [2021-08-30 16:08:04,813 INFO L226 Difference]: Without dead ends: 326 [2021-08-30 16:08:04,813 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.19ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-30 16:08:04,814 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 336.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 407.24ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:04,814 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 19 Invalid, 1038 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [9 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 407.24ms Time] [2021-08-30 16:08:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-30 16:08:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 318. [2021-08-30 16:08:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 276 states have (on average 1.4492753623188406) internal successors, (400), 314 states have internal predecessors, (400), 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-30 16:08:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 403 transitions. [2021-08-30 16:08:04,819 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 403 transitions. Word has length 40 [2021-08-30 16:08:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:04,819 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 403 transitions. [2021-08-30 16:08:04,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-30 16:08:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 403 transitions. [2021-08-30 16:08:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 16:08:04,820 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:04,820 INFO L513 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, 1, 1] [2021-08-30 16:08:04,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-30 16:08:04,820 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -371014859, now seen corresponding path program 1 times [2021-08-30 16:08:04,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:04,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246165060] [2021-08-30 16:08:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:04,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:04,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:04,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:04,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246165060] [2021-08-30 16:08:04,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246165060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:04,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:08:04,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 16:08:04,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169218871] [2021-08-30 16:08:04,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 16:08:04,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 16:08:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:08:04,874 INFO L87 Difference]: Start difference. First operand 318 states and 403 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-30 16:08:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:05,055 INFO L93 Difference]: Finished difference Result 316 states and 392 transitions. [2021-08-30 16:08:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 16:08:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 40 [2021-08-30 16:08:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:05,057 INFO L225 Difference]: With dead ends: 316 [2021-08-30 16:08:05,057 INFO L226 Difference]: Without dead ends: 316 [2021-08-30 16:08:05,057 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.98ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:08:05,058 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 75 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 176.47ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:05,058 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 7 Invalid, 366 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [4 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 176.47ms Time] [2021-08-30 16:08:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-30 16:08:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2021-08-30 16:08:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 276 states have (on average 1.4094202898550725) internal successors, (389), 310 states have internal predecessors, (389), 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-30 16:08:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 392 transitions. [2021-08-30 16:08:05,062 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 392 transitions. Word has length 40 [2021-08-30 16:08:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:05,062 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 392 transitions. [2021-08-30 16:08:05,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-30 16:08:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 392 transitions. [2021-08-30 16:08:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 16:08:05,063 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:05,063 INFO L513 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, 1, 1] [2021-08-30 16:08:05,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-30 16:08:05,063 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -371014858, now seen corresponding path program 1 times [2021-08-30 16:08:05,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:05,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715296468] [2021-08-30 16:08:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:05,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:05,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:05,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715296468] [2021-08-30 16:08:05,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715296468] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:05,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:08:05,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 16:08:05,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047565617] [2021-08-30 16:08:05,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 16:08:05,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 16:08:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:08:05,118 INFO L87 Difference]: Start difference. First operand 314 states and 392 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-30 16:08:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:05,293 INFO L93 Difference]: Finished difference Result 310 states and 381 transitions. [2021-08-30 16:08:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 16:08:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 40 [2021-08-30 16:08:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:05,294 INFO L225 Difference]: With dead ends: 310 [2021-08-30 16:08:05,294 INFO L226 Difference]: Without dead ends: 310 [2021-08-30 16:08:05,294 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.67ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 16:08:05,295 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 138.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.03ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:05,295 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 7 Invalid, 342 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 170.03ms Time] [2021-08-30 16:08:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-30 16:08:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-08-30 16:08:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 276 states have (on average 1.3695652173913044) internal successors, (378), 306 states have internal predecessors, (378), 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-30 16:08:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 381 transitions. [2021-08-30 16:08:05,299 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 381 transitions. Word has length 40 [2021-08-30 16:08:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:05,299 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 381 transitions. [2021-08-30 16:08:05,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-30 16:08:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 381 transitions. [2021-08-30 16:08:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 16:08:05,299 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:05,299 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-08-30 16:08:05,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-30 16:08:05,300 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr33REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461310, now seen corresponding path program 1 times [2021-08-30 16:08:05,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:05,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634564846] [2021-08-30 16:08:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:05,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:05,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:05,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634564846] [2021-08-30 16:08:05,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634564846] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:05,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 16:08:05,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 16:08:05,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100895558] [2021-08-30 16:08:05,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 16:08:05,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 16:08:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-30 16:08:05,358 INFO L87 Difference]: Start difference. First operand 310 states and 381 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-30 16:08:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:05,742 INFO L93 Difference]: Finished difference Result 332 states and 403 transitions. [2021-08-30 16:08:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 16:08:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 44 [2021-08-30 16:08:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:05,744 INFO L225 Difference]: With dead ends: 332 [2021-08-30 16:08:05,744 INFO L226 Difference]: Without dead ends: 332 [2021-08-30 16:08:05,744 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.30ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-30 16:08:05,744 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 291.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 352.70ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:05,745 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 16 Invalid, 840 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [12 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 352.70ms Time] [2021-08-30 16:08:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-30 16:08:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 313. [2021-08-30 16:08:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 279 states have (on average 1.3691756272401434) internal successors, (382), 309 states have internal predecessors, (382), 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-30 16:08:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 385 transitions. [2021-08-30 16:08:05,749 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 385 transitions. Word has length 44 [2021-08-30 16:08:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:05,749 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 385 transitions. [2021-08-30 16:08:05,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-30 16:08:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 385 transitions. [2021-08-30 16:08:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 16:08:05,750 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:05,750 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-08-30 16:08:05,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-30 16:08:05,750 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461309, now seen corresponding path program 1 times [2021-08-30 16:08:05,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:05,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681985838] [2021-08-30 16:08:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:05,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:05,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:06,000 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-30 16:08:06,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:06,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681985838] [2021-08-30 16:08:06,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681985838] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 16:08:06,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645396224] [2021-08-30 16:08:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:06,000 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:08:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:08:06,001 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-30 16:08:06,002 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-30 16:08:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:06,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-30 16:08:06,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 16:08:06,212 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 39 treesize of output 31 [2021-08-30 16:08:06,214 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 16 [2021-08-30 16:08:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 16:08:06,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 16:08:06,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645396224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 16:08:06,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 16:08:06,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2021-08-30 16:08:06,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996148255] [2021-08-30 16:08:06,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 16:08:06,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:06,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 16:08:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-08-30 16:08:06,255 INFO L87 Difference]: Start difference. First operand 313 states and 385 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-30 16:08:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:06,619 INFO L93 Difference]: Finished difference Result 325 states and 392 transitions. [2021-08-30 16:08:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 16:08:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 44 [2021-08-30 16:08:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:06,621 INFO L225 Difference]: With dead ends: 325 [2021-08-30 16:08:06,621 INFO L226 Difference]: Without dead ends: 325 [2021-08-30 16:08:06,621 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 227.22ms TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-08-30 16:08:06,621 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 273.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.36ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 330.35ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:06,622 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 15 Invalid, 747 Unknown, 0 Unchecked, 1.36ms Time], IncrementalHoareTripleChecker [10 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 330.35ms Time] [2021-08-30 16:08:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-30 16:08:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 311. [2021-08-30 16:08:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 279 states have (on average 1.3369175627240144) internal successors, (373), 307 states have internal predecessors, (373), 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-30 16:08:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 376 transitions. [2021-08-30 16:08:06,625 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 376 transitions. Word has length 44 [2021-08-30 16:08:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:06,626 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 376 transitions. [2021-08-30 16:08:06,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-30 16:08:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 376 transitions. [2021-08-30 16:08:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 16:08:06,626 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:06,626 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:08:06,646 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-30 16:08:06,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:08:06,837 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1353350043, now seen corresponding path program 1 times [2021-08-30 16:08:06,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:06,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952944529] [2021-08-30 16:08:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:06,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 16:08:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 16:08:07,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 16:08:07,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952944529] [2021-08-30 16:08:07,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952944529] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 16:08:07,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745301660] [2021-08-30 16:08:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:07,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:08:07,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 16:08:07,121 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-30 16:08:07,122 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-30 16:08:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 16:08:07,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-30 16:08:07,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 16:08:07,217 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-30 16:08:07,295 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 16:08:07,295 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-30 16:08:07,323 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-30 16:08:07,326 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-30 16:08:07,413 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 16:08:07,413 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-30 16:08:07,422 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-30 16:08:07,422 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-30 16:08:07,601 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-30 16:08:07,601 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 78 treesize of output 77 [2021-08-30 16:08:07,617 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-30 16:08:07,617 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 80 treesize of output 78 [2021-08-30 16:08:07,719 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-30 16:08:07,719 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 65 [2021-08-30 16:08:07,722 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-30 16:08:07,723 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 65 treesize of output 44 [2021-08-30 16:08:08,135 INFO L354 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2021-08-30 16:08:08,135 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 74 treesize of output 54 [2021-08-30 16:08:08,152 INFO L354 Elim1Store]: treesize reduction 54, result has 11.5 percent of original size [2021-08-30 16:08:08,152 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 39 treesize of output 32 [2021-08-30 16:08:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 16:08:08,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 16:08:28,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 16:08:28,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 16:08:28,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-08-30 16:08:28,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980606169] [2021-08-30 16:08:28,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 16:08:28,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 16:08:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 16:08:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1424, Unknown=9, NotChecked=0, Total=1560 [2021-08-30 16:08:28,761 INFO L87 Difference]: Start difference. First operand 311 states and 376 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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-30 16:08:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 16:08:30,678 INFO L93 Difference]: Finished difference Result 490 states and 573 transitions. [2021-08-30 16:08:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-30 16:08:30,679 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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 44 [2021-08-30 16:08:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 16:08:30,680 INFO L225 Difference]: With dead ends: 490 [2021-08-30 16:08:30,680 INFO L226 Difference]: Without dead ends: 490 [2021-08-30 16:08:30,681 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 21190.55ms TimeCoverageRelationStatistics Valid=356, Invalid=3667, Unknown=9, NotChecked=0, Total=4032 [2021-08-30 16:08:30,682 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 672 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 802.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.74ms SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 961.52ms IncrementalHoareTripleChecker+Time [2021-08-30 16:08:30,682 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 40 Invalid, 2298 Unknown, 0 Unchecked, 5.74ms Time], IncrementalHoareTripleChecker [121 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 961.52ms Time] [2021-08-30 16:08:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-08-30 16:08:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 309. [2021-08-30 16:08:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 278 states have (on average 1.3237410071942446) internal successors, (368), 305 states have internal predecessors, (368), 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-30 16:08:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 371 transitions. [2021-08-30 16:08:30,686 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 371 transitions. Word has length 44 [2021-08-30 16:08:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 16:08:30,686 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 371 transitions. [2021-08-30 16:08:30,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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-30 16:08:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 371 transitions. [2021-08-30 16:08:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-30 16:08:30,687 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 16:08:30,687 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 16:08:30,713 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-30 16:08:30,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 16:08:30,897 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-30 16:08:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 16:08:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -423467038, now seen corresponding path program 1 times [2021-08-30 16:08:30,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 16:08:30,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105988174] [2021-08-30 16:08:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 16:08:30,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 16:08:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 16:08:30,918 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 16:08:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 16:08:30,949 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 16:08:30,949 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 16:08:30,950 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2021-08-30 16:08:30,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (78 of 80 remaining) [2021-08-30 16:08:30,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (77 of 80 remaining) [2021-08-30 16:08:30,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (76 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (75 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION (74 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION (73 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION (72 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION (71 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION (70 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION (69 of 80 remaining) [2021-08-30 16:08:30,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION (68 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION (67 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION (66 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION (65 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION (64 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION (63 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION (62 of 80 remaining) [2021-08-30 16:08:30,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION (61 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION (60 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION (59 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ASSERT_VIOLATIONMEMORY_LEAK (58 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION (57 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION (56 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION (55 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION (54 of 80 remaining) [2021-08-30 16:08:30,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION (53 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION (52 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION (51 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION (50 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION (49 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION (48 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION (47 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION (46 of 80 remaining) [2021-08-30 16:08:30,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION (45 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION (44 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION (43 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION (42 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION (41 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION (40 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION (39 of 80 remaining) [2021-08-30 16:08:30,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION (38 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION (37 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION (36 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION (35 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION (34 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION (33 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION (32 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION (31 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION (30 of 80 remaining) [2021-08-30 16:08:30,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION (29 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION (28 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION (27 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION (26 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION (25 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION (24 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION (23 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION (22 of 80 remaining) [2021-08-30 16:08:30,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION (21 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION (20 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION (19 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION (18 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_LEAK (17 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK (16 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION (15 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION (14 of 80 remaining) [2021-08-30 16:08:30,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION (13 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION (12 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION (11 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION (10 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK (8 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION (7 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION (6 of 80 remaining) [2021-08-30 16:08:30,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION (5 of 80 remaining) [2021-08-30 16:08:30,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION (4 of 80 remaining) [2021-08-30 16:08:30,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2021-08-30 16:08:30,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2021-08-30 16:08:30,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2021-08-30 16:08:30,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2021-08-30 16:08:30,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-30 16:08:30,965 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 16:08:30,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:08:30 BoogieIcfgContainer [2021-08-30 16:08:30,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 16:08:30,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 16:08:30,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 16:08:30,999 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 16:08:30,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:03:11" (3/4) ... [2021-08-30 16:08:31,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-30 16:08:31,036 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-30 16:08:31,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 16:08:31,041 INFO L158 Benchmark]: Toolchain (without parser) took 320540.66ms. Allocated memory was 62.9MB in the beginning and 690.0MB in the end (delta: 627.0MB). Free memory was 35.3MB in the beginning and 390.0MB in the end (delta: -354.6MB). Peak memory consumption was 273.1MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,041 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory was 25.1MB in the beginning and 25.1MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 16:08:31,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.50ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 39.3MB in the end (delta: -4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,042 INFO L158 Benchmark]: Boogie Preprocessor took 84.07ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 36.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,042 INFO L158 Benchmark]: RCFGBuilder took 411.11ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 29.7MB in the end (delta: 6.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,042 INFO L158 Benchmark]: TraceAbstraction took 319628.56ms. Allocated memory was 62.9MB in the beginning and 690.0MB in the end (delta: 627.0MB). Free memory was 29.2MB in the beginning and 393.1MB in the end (delta: -363.9MB). Peak memory consumption was 264.4MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,043 INFO L158 Benchmark]: Witness Printer took 38.30ms. Allocated memory is still 690.0MB. Free memory was 393.1MB in the beginning and 390.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 16:08:31,047 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.17ms. Allocated memory is still 44.0MB. Free memory was 25.1MB in the beginning and 25.1MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.50ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 39.3MB in the end (delta: -4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.07ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 36.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 411.11ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 29.7MB in the end (delta: 6.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 319628.56ms. Allocated memory was 62.9MB in the beginning and 690.0MB in the end (delta: 627.0MB). Free memory was 29.2MB in the beginning and 393.1MB in the end (delta: -363.9MB). Peak memory consumption was 264.4MB. Max. memory is 16.1GB. * Witness Printer took 38.30ms. Allocated memory is still 690.0MB. Free memory was 393.1MB in the beginning and 390.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1038]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] head->data = 0 VAL [head={-1:0}] [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1010] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1010] x->next->prev = x VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] x = x->next [L1012] x->next = ((void*)0) VAL [head={-1:0}, marked=0, x={-2:0}] [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) VAL [head={-1:0}, marked=1, x={-2:0}] [L1020] x->data = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, marked=1, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, marked=1, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, marked=0, x={-1:0}] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next->data VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1037] x = x->next [L1038] EXPR x->data VAL [head={-1:0}, marked=0, x={-2:0}, x->data=1] [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, marked=0, x={-2:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: 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: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: 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: 1027]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: 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: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: 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: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: 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: 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: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1070]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: 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 4 procedures, 187 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 319536.90ms, OverallIterations: 21, TraceHistogramMax: 2, EmptinessCheckTime: 21.13ms, AutomataDifference: 15151.13ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 17.38ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5583 SdHoareTripleChecker+Valid, 9599.01ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5583 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 7838.00ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3246 IncrementalHoareTripleChecker+Unchecked, 8310 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20811 IncrementalHoareTripleChecker+Invalid, 24764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 61 mSDtfsCounter, 20811 mSolverCounterSat, 73.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 276 SyntacticMatches, 12 SemanticMatches, 369 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 86566.25ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=12, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 117.68ms AutomataMinimizationTime, 20 MinimizatonAttempts, 925 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 59.68ms SsaConstructionTime, 319.80ms SatisfiabilityAnalysisTime, 253736.77ms InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 727 ConstructedInterpolants, 51 QuantifiedInterpolants, 8908 SizeOfPredicates, 45 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 17/41 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 proved your program to be incorrect! [2021-08-30 16:08:31,137 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...