./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca3938b0f6534ae49041ee4478e6c9d2d7ab3e84 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca3938b0f6534ae49041ee4478e6c9d2d7ab3e84 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:20:30,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:20:30,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:20:30,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:20:30,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:20:30,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:20:30,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:20:30,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:20:30,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:20:30,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:20:30,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:20:30,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:20:30,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:20:30,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:20:30,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:20:30,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:20:30,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:20:30,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:20:30,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:20:30,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:20:30,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:20:30,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:20:30,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:20:30,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:20:30,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:20:30,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:20:30,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:20:30,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:20:30,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:20:30,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:20:30,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:20:30,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:20:30,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:20:30,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:20:30,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:20:30,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:20:30,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:20:30,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:20:30,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:20:30,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:20:30,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:20:30,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 05:20:30,965 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:20:30,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:20:30,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:20:30,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:20:30,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:20:30,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:20:30,968 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:20:30,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:20:30,968 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:20:30,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:20:30,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:20:30,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:20:30,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:20:30,969 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:20:30,969 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:20:30,970 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:20:30,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:20:30,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:20:30,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:20:30,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:20:30,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:20:30,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:20:30,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:20:30,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:20:30,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:20:30,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:20:30,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:20:30,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:20:30,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:20:30,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca3938b0f6534ae49041ee4478e6c9d2d7ab3e84 [2021-08-27 05:20:31,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:20:31,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:20:31,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:20:31,239 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:20:31,239 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:20:31,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-08-27 05:20:31,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e1d22c1/13d0bbf0d5d44fbcab68ea619c69f0d6/FLAG266ea920f [2021-08-27 05:20:31,752 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:20:31,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-08-27 05:20:31,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e1d22c1/13d0bbf0d5d44fbcab68ea619c69f0d6/FLAG266ea920f [2021-08-27 05:20:32,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e1d22c1/13d0bbf0d5d44fbcab68ea619c69f0d6 [2021-08-27 05:20:32,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:20:32,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:20:32,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:20:32,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:20:32,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:20:32,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48594eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32, skipping insertion in model container [2021-08-27 05:20:32,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:20:32,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:20:32,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:20:32,556 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:20:32,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:20:32,624 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:20:32,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32 WrapperNode [2021-08-27 05:20:32,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:20:32,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:20:32,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:20:32,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:20:32,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:20:32,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:20:32,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:20:32,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:20:32,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (1/1) ... [2021-08-27 05:20:32,704 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:20:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:32,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 05:20:32,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 05:20:32,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:20:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:20:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:20:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-27 05:20:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-27 05:20:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:20:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:20:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:20:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:20:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:20:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:20:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:20:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:20:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:20:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:20:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:20:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:20:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:20:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:20:32,758 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:20:32,758 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:20:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:20:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:20:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:20:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:20:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:20:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:20:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:20:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:20:32,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:20:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:20:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:20:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:20:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:20:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:20:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:20:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 05:20:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:20:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-27 05:20:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:20:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 05:20:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:20:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:20:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:20:32,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 05:20:32,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:20:33,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:20:33,386 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:20:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:20:33 BoogieIcfgContainer [2021-08-27 05:20:33,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:20:33,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:20:33,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:20:33,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:20:33,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:20:32" (1/3) ... [2021-08-27 05:20:33,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8be153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:20:33, skipping insertion in model container [2021-08-27 05:20:33,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:20:32" (2/3) ... [2021-08-27 05:20:33,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8be153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:20:33, skipping insertion in model container [2021-08-27 05:20:33,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:20:33" (3/3) ... [2021-08-27 05:20:33,392 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2021-08-27 05:20:33,395 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:20:33,395 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-27 05:20:33,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:20:33,424 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 05:20:33,424 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-27 05:20:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:20:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:20:33,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:33,438 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:33,439 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1846299228, now seen corresponding path program 1 times [2021-08-27 05:20:33,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:33,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172236217] [2021-08-27 05:20:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:33,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:33,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:33,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172236217] [2021-08-27 05:20:33,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172236217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:33,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:33,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:20:33,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264640462] [2021-08-27 05:20:33,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:20:33,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:33,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:20:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:20:33,723 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:33,963 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2021-08-27 05:20:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:20:33,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 8 [2021-08-27 05:20:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:33,973 INFO L225 Difference]: With dead ends: 92 [2021-08-27 05:20:33,973 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 05:20:33,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:20:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 05:20:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2021-08-27 05:20:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 65 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:20:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-08-27 05:20:34,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2021-08-27 05:20:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:34,005 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-08-27 05:20:34,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-08-27 05:20:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:20:34,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:34,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:34,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 05:20:34,006 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 451849005, now seen corresponding path program 1 times [2021-08-27 05:20:34,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:34,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794393681] [2021-08-27 05:20:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:34,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:34,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:34,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794393681] [2021-08-27 05:20:34,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794393681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:34,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:34,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:20:34,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950683882] [2021-08-27 05:20:34,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:20:34,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:20:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:34,200 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:34,511 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2021-08-27 05:20:34,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:20:34,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-08-27 05:20:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:34,513 INFO L225 Difference]: With dead ends: 91 [2021-08-27 05:20:34,513 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 05:20:34,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 205.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 05:20:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2021-08-27 05:20:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 66 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:20:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2021-08-27 05:20:34,518 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2021-08-27 05:20:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:34,519 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2021-08-27 05:20:34,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2021-08-27 05:20:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:20:34,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:34,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:34,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 05:20:34,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash 451908587, now seen corresponding path program 1 times [2021-08-27 05:20:34,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:34,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677809825] [2021-08-27 05:20:34,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:34,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:34,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:34,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677809825] [2021-08-27 05:20:34,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677809825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:34,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:34,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:20:34,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812654717] [2021-08-27 05:20:34,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:20:34,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:20:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:34,671 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:34,916 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2021-08-27 05:20:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:20:34,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 10 [2021-08-27 05:20:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:34,921 INFO L225 Difference]: With dead ends: 135 [2021-08-27 05:20:34,921 INFO L226 Difference]: Without dead ends: 135 [2021-08-27 05:20:34,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 170.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-27 05:20:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2021-08-27 05:20:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 99 states have internal predecessors, (141), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 05:20:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2021-08-27 05:20:34,928 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2021-08-27 05:20:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:34,928 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2021-08-27 05:20:34,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2021-08-27 05:20:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:20:34,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:34,929 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:34,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 05:20:34,929 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1124262917, now seen corresponding path program 1 times [2021-08-27 05:20:34,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:34,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537929987] [2021-08-27 05:20:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:34,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:35,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:35,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537929987] [2021-08-27 05:20:35,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537929987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:35,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:35,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:20:35,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203334676] [2021-08-27 05:20:35,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:20:35,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:20:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:35,011 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:35,138 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2021-08-27 05:20:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:20:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-08-27 05:20:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:35,140 INFO L225 Difference]: With dead ends: 149 [2021-08-27 05:20:35,140 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 05:20:35,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 05:20:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2021-08-27 05:20:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.7752808988764044) internal successors, (158), 115 states have internal predecessors, (158), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-27 05:20:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2021-08-27 05:20:35,156 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2021-08-27 05:20:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:35,157 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2021-08-27 05:20:35,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2021-08-27 05:20:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:20:35,158 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:35,158 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:35,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 05:20:35,159 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 649350680, now seen corresponding path program 1 times [2021-08-27 05:20:35,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:35,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757630481] [2021-08-27 05:20:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:35,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:35,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:35,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757630481] [2021-08-27 05:20:35,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757630481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:35,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:35,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:20:35,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436414456] [2021-08-27 05:20:35,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:20:35,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:20:35,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:35,247 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:35,450 INFO L93 Difference]: Finished difference Result 134 states and 196 transitions. [2021-08-27 05:20:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:20:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 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 13 [2021-08-27 05:20:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:35,452 INFO L225 Difference]: With dead ends: 134 [2021-08-27 05:20:35,452 INFO L226 Difference]: Without dead ends: 134 [2021-08-27 05:20:35,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 134.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:20:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-27 05:20:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2021-08-27 05:20:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.7582417582417582) internal successors, (160), 116 states have internal predecessors, (160), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-27 05:20:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2021-08-27 05:20:35,459 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 13 [2021-08-27 05:20:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:35,459 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2021-08-27 05:20:35,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2021-08-27 05:20:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:20:35,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:35,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:35,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 05:20:35,460 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609254, now seen corresponding path program 1 times [2021-08-27 05:20:35,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:35,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460277715] [2021-08-27 05:20:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:35,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:35,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:35,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460277715] [2021-08-27 05:20:35,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460277715] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:35,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:35,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:20:35,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267318085] [2021-08-27 05:20:35,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:20:35,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:35,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:20:35,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:35,535 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:35,758 INFO L93 Difference]: Finished difference Result 220 states and 324 transitions. [2021-08-27 05:20:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:20:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2021-08-27 05:20:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:35,761 INFO L225 Difference]: With dead ends: 220 [2021-08-27 05:20:35,761 INFO L226 Difference]: Without dead ends: 220 [2021-08-27 05:20:35,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-27 05:20:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 195. [2021-08-27 05:20:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.7236842105263157) internal successors, (262), 177 states have internal predecessors, (262), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2021-08-27 05:20:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 300 transitions. [2021-08-27 05:20:35,786 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 300 transitions. Word has length 13 [2021-08-27 05:20:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:35,786 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 300 transitions. [2021-08-27 05:20:35,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 300 transitions. [2021-08-27 05:20:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:20:35,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:35,787 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:35,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 05:20:35,787 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609253, now seen corresponding path program 1 times [2021-08-27 05:20:35,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:35,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705927919] [2021-08-27 05:20:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:35,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:35,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:35,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705927919] [2021-08-27 05:20:35,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705927919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:35,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:35,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:20:35,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348311947] [2021-08-27 05:20:35,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:20:35,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:35,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:20:35,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:20:35,866 INFO L87 Difference]: Start difference. First operand 195 states and 300 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:36,118 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2021-08-27 05:20:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:20:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2021-08-27 05:20:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:36,120 INFO L225 Difference]: With dead ends: 271 [2021-08-27 05:20:36,120 INFO L226 Difference]: Without dead ends: 271 [2021-08-27 05:20:36,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-27 05:20:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2021-08-27 05:20:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.696078431372549) internal successors, (346), 227 states have internal predecessors, (346), 14 states have call successors, (14), 14 states have call predecessors, (14), 15 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2021-08-27 05:20:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 384 transitions. [2021-08-27 05:20:36,126 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 384 transitions. Word has length 13 [2021-08-27 05:20:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:36,126 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 384 transitions. [2021-08-27 05:20:36,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 384 transitions. [2021-08-27 05:20:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 05:20:36,127 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:36,127 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:36,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 05:20:36,127 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2140662271, now seen corresponding path program 1 times [2021-08-27 05:20:36,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:36,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533307356] [2021-08-27 05:20:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:36,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:36,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:36,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533307356] [2021-08-27 05:20:36,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533307356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:36,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:36,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:20:36,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298569697] [2021-08-27 05:20:36,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:20:36,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:20:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:20:36,208 INFO L87 Difference]: Start difference. First operand 249 states and 384 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:36,398 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2021-08-27 05:20:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:20:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 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 14 [2021-08-27 05:20:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:36,400 INFO L225 Difference]: With dead ends: 235 [2021-08-27 05:20:36,400 INFO L226 Difference]: Without dead ends: 235 [2021-08-27 05:20:36,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:20:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-08-27 05:20:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2021-08-27 05:20:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 163 states have (on average 1.6319018404907975) internal successors, (266), 180 states have internal predecessors, (266), 12 states have call successors, (12), 12 states have call predecessors, (12), 13 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-27 05:20:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2021-08-27 05:20:36,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 14 [2021-08-27 05:20:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:36,408 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2021-08-27 05:20:36,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2021-08-27 05:20:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:20:36,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:36,410 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:36,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 05:20:36,411 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 406451957, now seen corresponding path program 1 times [2021-08-27 05:20:36,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:36,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635263650] [2021-08-27 05:20:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:36,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:36,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:36,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635263650] [2021-08-27 05:20:36,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635263650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:20:36,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:20:36,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:20:36,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580432052] [2021-08-27 05:20:36,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:20:36,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:20:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:20:36,497 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:36,654 INFO L93 Difference]: Finished difference Result 367 states and 512 transitions. [2021-08-27 05:20:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:20:36,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 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 15 [2021-08-27 05:20:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:36,655 INFO L225 Difference]: With dead ends: 367 [2021-08-27 05:20:36,655 INFO L226 Difference]: Without dead ends: 367 [2021-08-27 05:20:36,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:20:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-08-27 05:20:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 341. [2021-08-27 05:20:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 276 states have (on average 1.5072463768115942) internal successors, (416), 305 states have internal predecessors, (416), 22 states have call successors, (22), 22 states have call predecessors, (22), 31 states have return successors, (44), 13 states have call predecessors, (44), 21 states have call successors, (44) [2021-08-27 05:20:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 482 transitions. [2021-08-27 05:20:36,670 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 482 transitions. Word has length 15 [2021-08-27 05:20:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:36,670 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 482 transitions. [2021-08-27 05:20:36,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:20:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 482 transitions. [2021-08-27 05:20:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 05:20:36,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:36,673 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:36,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 05:20:36,674 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1475656894, now seen corresponding path program 1 times [2021-08-27 05:20:36,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:36,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267433339] [2021-08-27 05:20:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:36,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:36,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:36,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267433339] [2021-08-27 05:20:36,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267433339] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:36,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789069157] [2021-08-27 05:20:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:36,820 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:36,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:36,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:36,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 05:20:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:36,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:20:36,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:37,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789069157] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:37,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:37,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-27 05:20:37,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035395707] [2021-08-27 05:20:37,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:20:37,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:20:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:20:37,135 INFO L87 Difference]: Start difference. First operand 341 states and 482 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:37,763 INFO L93 Difference]: Finished difference Result 431 states and 610 transitions. [2021-08-27 05:20:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 05:20:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2021-08-27 05:20:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:37,766 INFO L225 Difference]: With dead ends: 431 [2021-08-27 05:20:37,766 INFO L226 Difference]: Without dead ends: 431 [2021-08-27 05:20:37,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 352.1ms TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-08-27 05:20:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-27 05:20:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 355. [2021-08-27 05:20:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 281 states have (on average 1.4697508896797153) internal successors, (413), 319 states have internal predecessors, (413), 22 states have call successors, (22), 22 states have call predecessors, (22), 40 states have return successors, (53), 13 states have call predecessors, (53), 21 states have call successors, (53) [2021-08-27 05:20:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2021-08-27 05:20:37,783 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 22 [2021-08-27 05:20:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:37,784 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2021-08-27 05:20:37,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2021-08-27 05:20:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:20:37,785 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:37,785 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:37,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:38,000 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,SelfDestructingSolverStorable9 [2021-08-27 05:20:38,001 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:38,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:38,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1528489980, now seen corresponding path program 1 times [2021-08-27 05:20:38,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:38,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550109209] [2021-08-27 05:20:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:38,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:38,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:38,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550109209] [2021-08-27 05:20:38,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550109209] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:38,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583929735] [2021-08-27 05:20:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:38,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:38,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:38,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 05:20:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:38,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:20:38,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:38,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583929735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:38,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:38,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-27 05:20:38,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799580881] [2021-08-27 05:20:38,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:20:38,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:20:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:20:38,399 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:39,022 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2021-08-27 05:20:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:20:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2021-08-27 05:20:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:39,024 INFO L225 Difference]: With dead ends: 623 [2021-08-27 05:20:39,025 INFO L226 Difference]: Without dead ends: 623 [2021-08-27 05:20:39,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 347.5ms TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:20:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-08-27 05:20:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 530. [2021-08-27 05:20:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.4254807692307692) internal successors, (593), 478 states have internal predecessors, (593), 32 states have call successors, (32), 32 states have call predecessors, (32), 70 states have return successors, (91), 19 states have call predecessors, (91), 31 states have call successors, (91) [2021-08-27 05:20:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 716 transitions. [2021-08-27 05:20:39,037 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 716 transitions. Word has length 24 [2021-08-27 05:20:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:39,037 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 716 transitions. [2021-08-27 05:20:39,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 716 transitions. [2021-08-27 05:20:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 05:20:39,038 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:39,038 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:39,058 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-27 05:20:39,258 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,SelfDestructingSolverStorable10 [2021-08-27 05:20:39,259 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:39,259 INFO L82 PathProgramCache]: Analyzing trace with hash -358281637, now seen corresponding path program 1 times [2021-08-27 05:20:39,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:39,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038991066] [2021-08-27 05:20:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:39,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 05:20:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:20:39,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:39,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038991066] [2021-08-27 05:20:39,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038991066] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:39,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832467253] [2021-08-27 05:20:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:39,431 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:39,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:39,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 05:20:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:39,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-27 05:20:39,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:20:39,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832467253] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:39,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:39,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-08-27 05:20:39,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493567735] [2021-08-27 05:20:39,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:20:39,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:20:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:20:39,826 INFO L87 Difference]: Start difference. First operand 530 states and 716 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:20:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:40,644 INFO L93 Difference]: Finished difference Result 1727 states and 2420 transitions. [2021-08-27 05:20:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:20:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2021-08-27 05:20:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:40,651 INFO L225 Difference]: With dead ends: 1727 [2021-08-27 05:20:40,651 INFO L226 Difference]: Without dead ends: 1727 [2021-08-27 05:20:40,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 471.8ms TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-08-27 05:20:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2021-08-27 05:20:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1484. [2021-08-27 05:20:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1196 states have (on average 1.4088628762541806) internal successors, (1685), 1336 states have internal predecessors, (1685), 92 states have call successors, (92), 92 states have call predecessors, (92), 184 states have return successors, (271), 55 states have call predecessors, (271), 91 states have call successors, (271) [2021-08-27 05:20:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2048 transitions. [2021-08-27 05:20:40,687 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2048 transitions. Word has length 35 [2021-08-27 05:20:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:40,688 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 2048 transitions. [2021-08-27 05:20:40,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:20:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2048 transitions. [2021-08-27 05:20:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 05:20:40,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:40,689 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:40,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:40,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:40,907 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1356372979, now seen corresponding path program 1 times [2021-08-27 05:20:40,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:40,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695544230] [2021-08-27 05:20:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:40,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:20:41,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:41,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695544230] [2021-08-27 05:20:41,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695544230] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:41,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566427609] [2021-08-27 05:20:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:41,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:41,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:41,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:41,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 05:20:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:41,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:20:41,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:20:41,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566427609] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:41,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:41,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-08-27 05:20:41,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920380509] [2021-08-27 05:20:41,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:20:41,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:20:41,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:20:41,403 INFO L87 Difference]: Start difference. First operand 1484 states and 2048 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:20:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:42,088 INFO L93 Difference]: Finished difference Result 2098 states and 3033 transitions. [2021-08-27 05:20:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 05:20:42,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2021-08-27 05:20:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:42,096 INFO L225 Difference]: With dead ends: 2098 [2021-08-27 05:20:42,097 INFO L226 Difference]: Without dead ends: 2098 [2021-08-27 05:20:42,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 371.1ms TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:20:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-08-27 05:20:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1836. [2021-08-27 05:20:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1471 states have (on average 1.399048266485384) internal successors, (2058), 1652 states have internal predecessors, (2058), 128 states have call successors, (128), 110 states have call predecessors, (128), 225 states have return successors, (377), 73 states have call predecessors, (377), 127 states have call successors, (377) [2021-08-27 05:20:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2563 transitions. [2021-08-27 05:20:42,143 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2563 transitions. Word has length 36 [2021-08-27 05:20:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:42,143 INFO L470 AbstractCegarLoop]: Abstraction has 1836 states and 2563 transitions. [2021-08-27 05:20:42,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:20:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2563 transitions. [2021-08-27 05:20:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 05:20:42,144 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:42,144 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:42,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:42,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:42,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1424599507, now seen corresponding path program 1 times [2021-08-27 05:20:42,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:42,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406288286] [2021-08-27 05:20:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:42,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 05:20:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:20:42,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:42,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406288286] [2021-08-27 05:20:42,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406288286] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:42,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550211020] [2021-08-27 05:20:42,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:42,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:42,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:42,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:42,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 05:20:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:42,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 05:20:42,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:20:42,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550211020] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:42,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:42,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2021-08-27 05:20:42,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150000889] [2021-08-27 05:20:42,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:20:42,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:20:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:20:42,910 INFO L87 Difference]: Start difference. First operand 1836 states and 2563 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:43,653 INFO L93 Difference]: Finished difference Result 1171 states and 1534 transitions. [2021-08-27 05:20:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 05:20:43,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-08-27 05:20:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:43,657 INFO L225 Difference]: With dead ends: 1171 [2021-08-27 05:20:43,657 INFO L226 Difference]: Without dead ends: 1073 [2021-08-27 05:20:43,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 477.1ms TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:20:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-08-27 05:20:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 906. [2021-08-27 05:20:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 714 states have (on average 1.3389355742296918) internal successors, (956), 802 states have internal predecessors, (956), 76 states have call successors, (76), 64 states have call predecessors, (76), 104 states have return successors, (157), 39 states have call predecessors, (157), 75 states have call successors, (157) [2021-08-27 05:20:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1189 transitions. [2021-08-27 05:20:43,678 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1189 transitions. Word has length 38 [2021-08-27 05:20:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:43,679 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1189 transitions. [2021-08-27 05:20:43,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:20:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1189 transitions. [2021-08-27 05:20:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 05:20:43,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:43,681 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:43,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:43,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-27 05:20:43,899 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash 421703127, now seen corresponding path program 1 times [2021-08-27 05:20:43,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:43,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799562333] [2021-08-27 05:20:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:43,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:43,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:20:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 05:20:44,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:44,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799562333] [2021-08-27 05:20:44,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799562333] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:44,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131898675] [2021-08-27 05:20:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:44,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:44,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:44,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 05:20:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:44,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:20:44,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 05:20:44,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131898675] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:44,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:44,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-08-27 05:20:44,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724772909] [2021-08-27 05:20:44,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:20:44,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:20:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:20:44,444 INFO L87 Difference]: Start difference. First operand 906 states and 1189 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 05:20:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:45,373 INFO L93 Difference]: Finished difference Result 1632 states and 2214 transitions. [2021-08-27 05:20:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:20:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 47 [2021-08-27 05:20:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:45,380 INFO L225 Difference]: With dead ends: 1632 [2021-08-27 05:20:45,380 INFO L226 Difference]: Without dead ends: 1632 [2021-08-27 05:20:45,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 502.6ms TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 05:20:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-08-27 05:20:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1297. [2021-08-27 05:20:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1034 states have (on average 1.3549323017408124) internal successors, (1401), 1157 states have internal predecessors, (1401), 100 states have call successors, (100), 88 states have call predecessors, (100), 151 states have return successors, (209), 51 states have call predecessors, (209), 99 states have call successors, (209) [2021-08-27 05:20:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1710 transitions. [2021-08-27 05:20:45,415 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1710 transitions. Word has length 47 [2021-08-27 05:20:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:45,415 INFO L470 AbstractCegarLoop]: Abstraction has 1297 states and 1710 transitions. [2021-08-27 05:20:45,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 05:20:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1710 transitions. [2021-08-27 05:20:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 05:20:45,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:45,417 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:45,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:45,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 05:20:45,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1681124145, now seen corresponding path program 1 times [2021-08-27 05:20:45,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:45,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510454289] [2021-08-27 05:20:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:45,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:20:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:20:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 05:20:45,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:45,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510454289] [2021-08-27 05:20:45,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510454289] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:45,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654088710] [2021-08-27 05:20:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:45,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:45,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 05:20:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:46,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 05:20:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 05:20:46,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654088710] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:46,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:46,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2021-08-27 05:20:46,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511342185] [2021-08-27 05:20:46,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:20:46,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:20:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:20:46,221 INFO L87 Difference]: Start difference. First operand 1297 states and 1710 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:20:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:46,737 INFO L93 Difference]: Finished difference Result 1831 states and 2507 transitions. [2021-08-27 05:20:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:20:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2021-08-27 05:20:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:46,744 INFO L225 Difference]: With dead ends: 1831 [2021-08-27 05:20:46,744 INFO L226 Difference]: Without dead ends: 1831 [2021-08-27 05:20:46,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 267.9ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:20:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2021-08-27 05:20:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1321. [2021-08-27 05:20:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1046 states have (on average 1.3508604206500956) internal successors, (1413), 1181 states have internal predecessors, (1413), 100 states have call successors, (100), 88 states have call predecessors, (100), 163 states have return successors, (233), 51 states have call predecessors, (233), 99 states have call successors, (233) [2021-08-27 05:20:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1746 transitions. [2021-08-27 05:20:46,774 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1746 transitions. Word has length 58 [2021-08-27 05:20:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:46,774 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1746 transitions. [2021-08-27 05:20:46,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:20:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1746 transitions. [2021-08-27 05:20:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:20:46,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:46,776 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:46,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:46,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:46,993 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 57126017, now seen corresponding path program 1 times [2021-08-27 05:20:46,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:46,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496027724] [2021-08-27 05:20:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:46,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 05:20:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 05:20:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-27 05:20:47,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:47,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496027724] [2021-08-27 05:20:47,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496027724] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:47,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947366023] [2021-08-27 05:20:47,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:47,158 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:47,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 05:20:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:47,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:20:47,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 05:20:47,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947366023] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:47,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:47,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2021-08-27 05:20:47,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107526549] [2021-08-27 05:20:47,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 05:20:47,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:47,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 05:20:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-08-27 05:20:47,603 INFO L87 Difference]: Start difference. First operand 1321 states and 1746 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-27 05:20:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:54,560 INFO L93 Difference]: Finished difference Result 5435 states and 7408 transitions. [2021-08-27 05:20:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2021-08-27 05:20:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 60 [2021-08-27 05:20:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:54,574 INFO L225 Difference]: With dead ends: 5435 [2021-08-27 05:20:54,575 INFO L226 Difference]: Without dead ends: 5343 [2021-08-27 05:20:54,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10272 ImplicationChecksByTransitivity, 4265.3ms TimeCoverageRelationStatistics Valid=3114, Invalid=23618, Unknown=0, NotChecked=0, Total=26732 [2021-08-27 05:20:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2021-08-27 05:20:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4426. [2021-08-27 05:20:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 3518 states have (on average 1.3328595793064242) internal successors, (4689), 3956 states have internal predecessors, (4689), 340 states have call successors, (340), 298 states have call predecessors, (340), 557 states have return successors, (939), 171 states have call predecessors, (939), 339 states have call successors, (939) [2021-08-27 05:20:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 5968 transitions. [2021-08-27 05:20:54,655 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 5968 transitions. Word has length 60 [2021-08-27 05:20:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:54,655 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 5968 transitions. [2021-08-27 05:20:54,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-27 05:20:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 5968 transitions. [2021-08-27 05:20:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:20:54,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:54,656 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:20:54,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:54,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-27 05:20:54,869 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1356938417, now seen corresponding path program 1 times [2021-08-27 05:20:54,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:54,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436458651] [2021-08-27 05:20:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:54,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:20:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 05:20:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 05:20:55,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:55,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436458651] [2021-08-27 05:20:55,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436458651] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:55,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120137859] [2021-08-27 05:20:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:55,015 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:55,017 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:55,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 05:20:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:55,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:20:55,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:20:55,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120137859] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:55,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:55,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-08-27 05:20:55,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488424486] [2021-08-27 05:20:55,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 05:20:55,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 05:20:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-08-27 05:20:55,550 INFO L87 Difference]: Start difference. First operand 4426 states and 5968 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 05:20:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:56,794 INFO L93 Difference]: Finished difference Result 9129 states and 12769 transitions. [2021-08-27 05:20:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 05:20:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 60 [2021-08-27 05:20:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:56,846 INFO L225 Difference]: With dead ends: 9129 [2021-08-27 05:20:56,847 INFO L226 Difference]: Without dead ends: 9129 [2021-08-27 05:20:56,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 755.1ms TimeCoverageRelationStatistics Valid=547, Invalid=1903, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:20:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9129 states. [2021-08-27 05:20:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9129 to 7078. [2021-08-27 05:20:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7078 states, 5734 states have (on average 1.3566445762120685) internal successors, (7779), 6356 states have internal predecessors, (7779), 508 states have call successors, (508), 466 states have call predecessors, (508), 825 states have return successors, (1407), 255 states have call predecessors, (1407), 507 states have call successors, (1407) [2021-08-27 05:20:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 9694 transitions. [2021-08-27 05:20:56,993 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 9694 transitions. Word has length 60 [2021-08-27 05:20:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:56,994 INFO L470 AbstractCegarLoop]: Abstraction has 7078 states and 9694 transitions. [2021-08-27 05:20:56,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 05:20:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 9694 transitions. [2021-08-27 05:20:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 05:20:56,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:56,996 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-27 05:20:57,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:57,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-27 05:20:57,217 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 7649356, now seen corresponding path program 1 times [2021-08-27 05:20:57,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:57,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951605772] [2021-08-27 05:20:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:57,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:20:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-08-27 05:20:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 05:20:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-27 05:20:57,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:57,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951605772] [2021-08-27 05:20:57,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951605772] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:57,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865326853] [2021-08-27 05:20:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:57,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:57,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:57,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:57,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 05:20:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:20:57,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:20:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 05:20:57,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865326853] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:57,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:20:57,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-08-27 05:20:57,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040965148] [2021-08-27 05:20:57,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:20:57,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:20:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:20:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:20:57,867 INFO L87 Difference]: Start difference. First operand 7078 states and 9694 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 05:20:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:20:59,367 INFO L93 Difference]: Finished difference Result 9161 states and 12559 transitions. [2021-08-27 05:20:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 05:20:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 71 [2021-08-27 05:20:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:20:59,389 INFO L225 Difference]: With dead ends: 9161 [2021-08-27 05:20:59,389 INFO L226 Difference]: Without dead ends: 9075 [2021-08-27 05:20:59,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 964.5ms TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2021-08-27 05:20:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2021-08-27 05:20:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 8506. [2021-08-27 05:20:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 6792 states have (on average 1.3308303886925794) internal successors, (9039), 7616 states have internal predecessors, (9039), 676 states have call successors, (676), 550 states have call predecessors, (676), 1027 states have return successors, (1959), 339 states have call predecessors, (1959), 675 states have call successors, (1959) [2021-08-27 05:20:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 11674 transitions. [2021-08-27 05:20:59,529 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 11674 transitions. Word has length 71 [2021-08-27 05:20:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:20:59,530 INFO L470 AbstractCegarLoop]: Abstraction has 8506 states and 11674 transitions. [2021-08-27 05:20:59,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 05:20:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 11674 transitions. [2021-08-27 05:20:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-27 05:20:59,532 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:20:59,532 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-08-27 05:20:59,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:20:59,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:59,745 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:20:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:20:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1516849340, now seen corresponding path program 1 times [2021-08-27 05:20:59,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:20:59,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614710501] [2021-08-27 05:20:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:59,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:20:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:20:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:20:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:20:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:20:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:20:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-08-27 05:20:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 05:20:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:20:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 82 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-08-27 05:20:59,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:20:59,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614710501] [2021-08-27 05:20:59,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614710501] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:20:59,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046715792] [2021-08-27 05:20:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:20:59,893 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:20:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:20:59,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:20:59,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 05:21:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:00,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 05:21:00,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 80 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-27 05:21:00,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046715792] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:21:00,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:00,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2021-08-27 05:21:00,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942868122] [2021-08-27 05:21:00,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:21:00,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:21:00,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:21:00,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:21:00,435 INFO L87 Difference]: Start difference. First operand 8506 states and 11674 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:21:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:01,270 INFO L93 Difference]: Finished difference Result 11210 states and 15593 transitions. [2021-08-27 05:21:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 05:21:01,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2021-08-27 05:21:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:01,302 INFO L225 Difference]: With dead ends: 11210 [2021-08-27 05:21:01,303 INFO L226 Difference]: Without dead ends: 11210 [2021-08-27 05:21:01,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 451.5ms TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2021-08-27 05:21:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11210 states. [2021-08-27 05:21:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11210 to 8506. [2021-08-27 05:21:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 6792 states have (on average 1.3308303886925794) internal successors, (9039), 7616 states have internal predecessors, (9039), 676 states have call successors, (676), 550 states have call predecessors, (676), 1027 states have return successors, (1959), 339 states have call predecessors, (1959), 675 states have call successors, (1959) [2021-08-27 05:21:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 11674 transitions. [2021-08-27 05:21:01,540 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 11674 transitions. Word has length 82 [2021-08-27 05:21:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:01,540 INFO L470 AbstractCegarLoop]: Abstraction has 8506 states and 11674 transitions. [2021-08-27 05:21:01,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:21:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 11674 transitions. [2021-08-27 05:21:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-27 05:21:01,542 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:01,542 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-08-27 05:21:01,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:01,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:21:01,743 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1173694170, now seen corresponding path program 1 times [2021-08-27 05:21:01,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:21:01,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686104114] [2021-08-27 05:21:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:01,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:21:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:21:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:21:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:21:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:21:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 05:21:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-08-27 05:21:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-08-27 05:21:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-27 05:21:01,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:21:01,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686104114] [2021-08-27 05:21:01,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686104114] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:21:01,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922707326] [2021-08-27 05:21:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:01,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:21:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:21:01,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:21:01,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 05:21:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:02,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:21:02,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 48 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-27 05:21:02,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922707326] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:21:02,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:02,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-08-27 05:21:02,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179501166] [2021-08-27 05:21:02,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:21:02,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:21:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:21:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:21:02,541 INFO L87 Difference]: Start difference. First operand 8506 states and 11674 transitions. Second operand has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:21:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:04,729 INFO L93 Difference]: Finished difference Result 13729 states and 18929 transitions. [2021-08-27 05:21:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-27 05:21:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 84 [2021-08-27 05:21:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:04,757 INFO L225 Difference]: With dead ends: 13729 [2021-08-27 05:21:04,758 INFO L226 Difference]: Without dead ends: 13093 [2021-08-27 05:21:04,760 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1598.3ms TimeCoverageRelationStatistics Valid=778, Invalid=3254, Unknown=0, NotChecked=0, Total=4032 [2021-08-27 05:21:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13093 states. [2021-08-27 05:21:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13093 to 8840. [2021-08-27 05:21:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 7064 states have (on average 1.3180917327293318) internal successors, (9311), 7908 states have internal predecessors, (9311), 676 states have call successors, (676), 592 states have call predecessors, (676), 1089 states have return successors, (2001), 339 states have call predecessors, (2001), 675 states have call successors, (2001) [2021-08-27 05:21:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 11988 transitions. [2021-08-27 05:21:04,924 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 11988 transitions. Word has length 84 [2021-08-27 05:21:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:04,924 INFO L470 AbstractCegarLoop]: Abstraction has 8840 states and 11988 transitions. [2021-08-27 05:21:04,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:21:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 11988 transitions. [2021-08-27 05:21:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-27 05:21:04,925 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:04,926 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:04,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:05,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-27 05:21:05,141 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 57278106, now seen corresponding path program 1 times [2021-08-27 05:21:05,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:21:05,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138365876] [2021-08-27 05:21:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:05,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:21:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:21:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:21:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:21:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:21:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:21:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-08-27 05:21:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 05:21:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 70 proven. 29 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-08-27 05:21:05,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:21:05,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138365876] [2021-08-27 05:21:05,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138365876] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:21:05,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528360881] [2021-08-27 05:21:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:05,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:21:05,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:21:05,274 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:21:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 05:21:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:05,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:21:05,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-27 05:21:05,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528360881] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:21:05,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:05,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-08-27 05:21:05,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169911246] [2021-08-27 05:21:05,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:21:05,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:21:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:21:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:21:05,942 INFO L87 Difference]: Start difference. First operand 8840 states and 11988 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:21:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:07,067 INFO L93 Difference]: Finished difference Result 7383 states and 9497 transitions. [2021-08-27 05:21:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-27 05:21:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 84 [2021-08-27 05:21:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:07,084 INFO L225 Difference]: With dead ends: 7383 [2021-08-27 05:21:07,084 INFO L226 Difference]: Without dead ends: 6879 [2021-08-27 05:21:07,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 663.6ms TimeCoverageRelationStatistics Valid=589, Invalid=2063, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 05:21:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6879 states. [2021-08-27 05:21:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6879 to 6570. [2021-08-27 05:21:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5270 states have (on average 1.276470588235294) internal successors, (6727), 5848 states have internal predecessors, (6727), 508 states have call successors, (508), 466 states have call predecessors, (508), 781 states have return successors, (1239), 255 states have call predecessors, (1239), 507 states have call successors, (1239) [2021-08-27 05:21:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8474 transitions. [2021-08-27 05:21:07,192 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8474 transitions. Word has length 84 [2021-08-27 05:21:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:07,193 INFO L470 AbstractCegarLoop]: Abstraction has 6570 states and 8474 transitions. [2021-08-27 05:21:07,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:21:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8474 transitions. [2021-08-27 05:21:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 05:21:07,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:07,195 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:07,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:07,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 05:21:07,402 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -478636956, now seen corresponding path program 1 times [2021-08-27 05:21:07,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:21:07,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749440642] [2021-08-27 05:21:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:07,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:21:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:21:07,427 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:21:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:21:07,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 05:21:07,491 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:21:07,491 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:21:07,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION [2021-08-27 05:21:07,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION [2021-08-27 05:21:07,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION [2021-08-27 05:21:07,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION [2021-08-27 05:21:07,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:07,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:07,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 05:21:07,500 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:21:07,526 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:21:07,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:21:07 BoogieIcfgContainer [2021-08-27 05:21:07,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:21:07,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:21:07,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:21:07,567 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:21:07,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:20:33" (3/4) ... [2021-08-27 05:21:07,569 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:21:07,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:21:07,570 INFO L168 Benchmark]: Toolchain (without parser) took 35302.75 ms. Allocated memory was 52.4 MB in the beginning and 578.8 MB in the end (delta: 526.4 MB). Free memory was 27.6 MB in the beginning and 230.8 MB in the end (delta: -203.2 MB). Peak memory consumption was 321.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:07,571 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 52.4 MB. Free memory was 34.0 MB in the beginning and 33.9 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:21:07,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.49 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.4 MB in the beginning and 38.9 MB in the end (delta: -11.5 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:07,571 INFO L168 Benchmark]: Boogie Preprocessor took 67.19 ms. Allocated memory is still 62.9 MB. Free memory was 38.9 MB in the beginning and 36.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:07,572 INFO L168 Benchmark]: RCFGBuilder took 693.28 ms. Allocated memory is still 62.9 MB. Free memory was 36.0 MB in the beginning and 30.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:07,572 INFO L168 Benchmark]: TraceAbstraction took 34178.09 ms. Allocated memory was 62.9 MB in the beginning and 578.8 MB in the end (delta: 515.9 MB). Free memory was 30.4 MB in the beginning and 230.8 MB in the end (delta: -200.4 MB). Peak memory consumption was 315.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:07,572 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 578.8 MB. Free memory is still 230.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:21:07,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 52.4 MB. Free memory was 34.0 MB in the beginning and 33.9 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 357.49 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.4 MB in the beginning and 38.9 MB in the end (delta: -11.5 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.19 ms. Allocated memory is still 62.9 MB. Free memory was 38.9 MB in the beginning and 36.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 693.28 ms. Allocated memory is still 62.9 MB. Free memory was 36.0 MB in the beginning and 30.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34178.09 ms. Allocated memory was 62.9 MB in the beginning and 578.8 MB in the end (delta: 515.9 MB). Free memory was 30.4 MB in the beginning and 230.8 MB in the end (delta: -200.4 MB). Peak memory consumption was 315.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.85 ms. Allocated memory is still 578.8 MB. Free memory is still 230.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=54, \old(garbage)=49, \old(pc1)=67, \old(pc4)=50, \old(res4)=60, \old(S)=55, \old(S)=57, \old(t1)=62, \old(t1)=70, \old(t4)=53, \old(t4)=58, \old(x1)=74, \old(x1)=61, \old(x4)=68, \old(x4)=51, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 92 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 34079.1ms, OverallIterations: 23, TraceHistogramMax: 7, EmptinessCheckTime: 30.5ms, AutomataDifference: 21012.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1947 SDtfs, 6771 SDslu, 4282 SDs, 0 SdLazy, 13799 SolverSat, 2709 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7680.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1494 GetRequests, 891 SyntacticMatches, 2 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14297 ImplicationChecksByTransitivity, 12417.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8840occurred in iteration=21, InterpolantAutomatonStates: 533, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1163.0ms AutomataMinimizationTime, 22 MinimizatonAttempts, 12685 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 296.7ms SsaConstructionTime, 847.6ms SatisfiabilityAnalysisTime, 5299.3ms InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 6919 SizeOfPredicates, 58 NumberOfNonLiveVariables, 6597 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 1332/1656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 05:21:07,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:21:09,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:21:09,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:21:09,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:21:09,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:21:09,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:21:09,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:21:09,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:21:09,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:21:09,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:21:09,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:21:09,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:21:09,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:21:09,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:21:09,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:21:09,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:21:09,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:21:09,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:21:09,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:21:09,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:21:09,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:21:09,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:21:09,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:21:09,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:21:09,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:21:09,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:21:09,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:21:09,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:21:09,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:21:09,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:21:09,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:21:09,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:21:09,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:21:09,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:21:09,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:21:09,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:21:09,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:21:09,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:21:09,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:21:09,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:21:09,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:21:09,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 05:21:09,179 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:21:09,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:21:09,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:21:09,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:21:09,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:21:09,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:21:09,180 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:21:09,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:21:09,180 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:21:09,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:21:09,181 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:21:09,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:21:09,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 05:21:09,182 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 05:21:09,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:21:09,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 05:21:09,183 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca3938b0f6534ae49041ee4478e6c9d2d7ab3e84 [2021-08-27 05:21:09,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:21:09,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:21:09,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:21:09,415 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:21:09,415 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:21:09,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-08-27 05:21:09,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3144f444/11f871972b4e4d849cf1fd448fae4949/FLAGaf3149dcb [2021-08-27 05:21:09,856 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:21:09,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-08-27 05:21:09,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3144f444/11f871972b4e4d849cf1fd448fae4949/FLAGaf3149dcb [2021-08-27 05:21:09,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3144f444/11f871972b4e4d849cf1fd448fae4949 [2021-08-27 05:21:09,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:21:09,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:21:09,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:21:09,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:21:09,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:21:09,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:21:09" (1/1) ... [2021-08-27 05:21:09,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eca7aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:09, skipping insertion in model container [2021-08-27 05:21:09,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:21:09" (1/1) ... [2021-08-27 05:21:09,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:21:09,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:21:10,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:21:10,159 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:21:10,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:21:10,231 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:21:10,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10 WrapperNode [2021-08-27 05:21:10,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:21:10,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:21:10,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:21:10,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:21:10,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:21:10,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:21:10,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:21:10,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:21:10,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (1/1) ... [2021-08-27 05:21:10,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:21:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:21:10,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 05:21:10,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 05:21:10,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:21:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:21:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-27 05:21:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-27 05:21:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:21:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:21:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:21:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:21:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:21:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:21:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:21:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:21:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:21:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:21:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:21:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 05:21:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 05:21:10,859 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:21:10,859 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:21:10,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:21:10 BoogieIcfgContainer [2021-08-27 05:21:10,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:21:10,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:21:10,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:21:10,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:21:10,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:21:09" (1/3) ... [2021-08-27 05:21:10,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:21:10, skipping insertion in model container [2021-08-27 05:21:10,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:21:10" (2/3) ... [2021-08-27 05:21:10,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:21:10, skipping insertion in model container [2021-08-27 05:21:10,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:21:10" (3/3) ... [2021-08-27 05:21:10,865 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2021-08-27 05:21:10,868 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:21:10,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-27 05:21:10,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:21:10,903 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 05:21:10,903 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-27 05:21:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:21:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:21:10,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:10,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:10,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 913050877, now seen corresponding path program 1 times [2021-08-27 05:21:10,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:10,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634208526] [2021-08-27 05:21:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:10,927 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:10,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:10,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:10,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 05:21:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:11,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 05:21:11,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:11,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:11,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:11,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634208526] [2021-08-27 05:21:11,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634208526] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:11,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:11,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:21:11,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55774553] [2021-08-27 05:21:11,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 05:21:11,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 05:21:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:21:11,198 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:11,212 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2021-08-27 05:21:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 05:21:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 8 [2021-08-27 05:21:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:11,220 INFO L225 Difference]: With dead ends: 72 [2021-08-27 05:21:11,220 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:21:11,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:21:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:21:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:21:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 63 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:21:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2021-08-27 05:21:11,255 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2021-08-27 05:21:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:11,256 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2021-08-27 05:21:11,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2021-08-27 05:21:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:21:11,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:11,257 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:11,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:11,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:11,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 913039345, now seen corresponding path program 1 times [2021-08-27 05:21:11,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:11,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477560366] [2021-08-27 05:21:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:11,466 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:11,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:11,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 05:21:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 05:21:11,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:11,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:11,766 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:11,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477560366] [2021-08-27 05:21:11,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477560366] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:11,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:11,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 05:21:11,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384928809] [2021-08-27 05:21:11,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:21:11,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:21:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:11,770 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:11,817 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2021-08-27 05:21:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:21:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 8 [2021-08-27 05:21:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:11,822 INFO L225 Difference]: With dead ends: 120 [2021-08-27 05:21:11,822 INFO L226 Difference]: Without dead ends: 120 [2021-08-27 05:21:11,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-27 05:21:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2021-08-27 05:21:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 93 states have internal predecessors, (133), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 05:21:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2021-08-27 05:21:11,840 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 8 [2021-08-27 05:21:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:11,840 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2021-08-27 05:21:11,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2021-08-27 05:21:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:21:11,843 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:11,843 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:11,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:12,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:12,053 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1760552785, now seen corresponding path program 1 times [2021-08-27 05:21:12,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:12,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289463100] [2021-08-27 05:21:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:12,055 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:12,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:12,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:12,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 05:21:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:12,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:21:12,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:12,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:12,262 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:12,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289463100] [2021-08-27 05:21:12,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289463100] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:12,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:12,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:21:12,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230087083] [2021-08-27 05:21:12,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:21:12,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:21:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:12,263 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:12,337 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2021-08-27 05:21:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:21:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2021-08-27 05:21:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:12,339 INFO L225 Difference]: With dead ends: 128 [2021-08-27 05:21:12,339 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 05:21:12,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 05:21:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2021-08-27 05:21:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 104 states have internal predecessors, (143), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-27 05:21:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2021-08-27 05:21:12,345 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 9 [2021-08-27 05:21:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:12,345 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2021-08-27 05:21:12,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2021-08-27 05:21:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:21:12,345 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:12,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:12,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:12,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:12,552 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 370381771, now seen corresponding path program 1 times [2021-08-27 05:21:12,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:12,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634391778] [2021-08-27 05:21:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:12,554 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:12,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:12,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 05:21:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:12,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:21:12,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:12,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:21:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:12,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:12,773 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:12,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634391778] [2021-08-27 05:21:12,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634391778] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:12,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:12,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:21:12,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061190568] [2021-08-27 05:21:12,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:21:12,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:21:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:12,775 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:12,861 INFO L93 Difference]: Finished difference Result 198 states and 290 transitions. [2021-08-27 05:21:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:21:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 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 11 [2021-08-27 05:21:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:12,862 INFO L225 Difference]: With dead ends: 198 [2021-08-27 05:21:12,862 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 05:21:12,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:21:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 05:21:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2021-08-27 05:21:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.7761194029850746) internal successors, (238), 160 states have internal predecessors, (238), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2021-08-27 05:21:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2021-08-27 05:21:12,869 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 11 [2021-08-27 05:21:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:12,870 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2021-08-27 05:21:12,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2021-08-27 05:21:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:21:12,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:12,870 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:12,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:13,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:13,078 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 370381772, now seen corresponding path program 1 times [2021-08-27 05:21:13,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:13,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790358763] [2021-08-27 05:21:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:13,079 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:13,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:13,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 05:21:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:13,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:21:13,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:13,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:21:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:13,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:13,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:13,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790358763] [2021-08-27 05:21:13,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790358763] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:13,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:13,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:21:13,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114628761] [2021-08-27 05:21:13,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:21:13,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:21:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:21:13,333 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:13,513 INFO L93 Difference]: Finished difference Result 333 states and 499 transitions. [2021-08-27 05:21:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:21:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 11 [2021-08-27 05:21:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:13,516 INFO L225 Difference]: With dead ends: 333 [2021-08-27 05:21:13,516 INFO L226 Difference]: Without dead ends: 333 [2021-08-27 05:21:13,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:21:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-27 05:21:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2021-08-27 05:21:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.7314049586776858) internal successors, (419), 268 states have internal predecessors, (419), 18 states have call successors, (18), 18 states have call predecessors, (18), 19 states have return successors, (35), 9 states have call predecessors, (35), 17 states have call successors, (35) [2021-08-27 05:21:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 472 transitions. [2021-08-27 05:21:13,535 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 472 transitions. Word has length 11 [2021-08-27 05:21:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:13,535 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 472 transitions. [2021-08-27 05:21:13,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 472 transitions. [2021-08-27 05:21:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 05:21:13,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:13,536 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:13,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:13,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:13,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1403059964, now seen corresponding path program 1 times [2021-08-27 05:21:13,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:13,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106561297] [2021-08-27 05:21:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:13,737 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:13,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:13,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 05:21:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:13,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:21:13,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:13,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:13,989 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:13,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106561297] [2021-08-27 05:21:13,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106561297] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:13,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:13,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 05:21:13,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539798733] [2021-08-27 05:21:13,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:21:13,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:21:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:21:13,992 INFO L87 Difference]: Start difference. First operand 295 states and 472 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:14,021 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2021-08-27 05:21:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:21:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 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 12 [2021-08-27 05:21:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:14,023 INFO L225 Difference]: With dead ends: 197 [2021-08-27 05:21:14,024 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 05:21:14,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:21:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 05:21:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2021-08-27 05:21:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.6736111111111112) internal successors, (241), 162 states have internal predecessors, (241), 12 states have call successors, (12), 12 states have call predecessors, (12), 13 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-27 05:21:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2021-08-27 05:21:14,034 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 12 [2021-08-27 05:21:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:14,034 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2021-08-27 05:21:14,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2021-08-27 05:21:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:21:14,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:14,035 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:14,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:14,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:14,249 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2074754906, now seen corresponding path program 1 times [2021-08-27 05:21:14,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:14,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169569245] [2021-08-27 05:21:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:14,250 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:14,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:14,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:14,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 05:21:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:14,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:21:14,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:14,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:14,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:14,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169569245] [2021-08-27 05:21:14,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169569245] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:21:14,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:21:14,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 05:21:14,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351901783] [2021-08-27 05:21:14,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:21:14,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:21:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:21:14,483 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:14,514 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2021-08-27 05:21:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:21:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 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 13 [2021-08-27 05:21:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:14,515 INFO L225 Difference]: With dead ends: 281 [2021-08-27 05:21:14,515 INFO L226 Difference]: Without dead ends: 281 [2021-08-27 05:21:14,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:21:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-08-27 05:21:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-08-27 05:21:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.5648148148148149) internal successors, (338), 246 states have internal predecessors, (338), 22 states have call successors, (22), 22 states have call predecessors, (22), 31 states have return successors, (44), 13 states have call predecessors, (44), 21 states have call successors, (44) [2021-08-27 05:21:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2021-08-27 05:21:14,522 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 13 [2021-08-27 05:21:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:14,522 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2021-08-27 05:21:14,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:21:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2021-08-27 05:21:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 05:21:14,523 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:14,523 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:14,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:14,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:14,724 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1772709125, now seen corresponding path program 1 times [2021-08-27 05:21:14,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:14,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819353064] [2021-08-27 05:21:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:14,725 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:14,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:14,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 05:21:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:14,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:21:14,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:14,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:15,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:15,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819353064] [2021-08-27 05:21:15,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819353064] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:15,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:15,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-27 05:21:15,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096860976] [2021-08-27 05:21:15,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:21:15,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:21:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:21:15,166 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:21:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:15,777 INFO L93 Difference]: Finished difference Result 690 states and 1010 transitions. [2021-08-27 05:21:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:21:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2021-08-27 05:21:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:15,780 INFO L225 Difference]: With dead ends: 690 [2021-08-27 05:21:15,780 INFO L226 Difference]: Without dead ends: 690 [2021-08-27 05:21:15,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 133.3ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:21:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-27 05:21:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 587. [2021-08-27 05:21:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 472 states have (on average 1.5423728813559323) internal successors, (728), 520 states have internal predecessors, (728), 42 states have call successors, (42), 42 states have call predecessors, (42), 61 states have return successors, (95), 25 states have call predecessors, (95), 41 states have call successors, (95) [2021-08-27 05:21:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 865 transitions. [2021-08-27 05:21:15,798 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 865 transitions. Word has length 18 [2021-08-27 05:21:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:15,799 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 865 transitions. [2021-08-27 05:21:15,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:21:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 865 transitions. [2021-08-27 05:21:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:21:15,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:15,799 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:15,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:16,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:16,009 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1092083902, now seen corresponding path program 1 times [2021-08-27 05:21:16,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:16,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229735945] [2021-08-27 05:21:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:16,010 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:16,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:16,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 05:21:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:16,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:21:16,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:16,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:16,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:16,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229735945] [2021-08-27 05:21:16,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229735945] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:16,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:16,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-08-27 05:21:16,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856277349] [2021-08-27 05:21:16,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:21:16,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:21:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:21:16,410 INFO L87 Difference]: Start difference. First operand 587 states and 865 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:21:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:16,876 INFO L93 Difference]: Finished difference Result 909 states and 1312 transitions. [2021-08-27 05:21:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:21:16,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2021-08-27 05:21:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:16,880 INFO L225 Difference]: With dead ends: 909 [2021-08-27 05:21:16,880 INFO L226 Difference]: Without dead ends: 909 [2021-08-27 05:21:16,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 161.8ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:21:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-08-27 05:21:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 837. [2021-08-27 05:21:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 666 states have (on average 1.5015015015015014) internal successors, (1000), 738 states have internal predecessors, (1000), 62 states have call successors, (62), 62 states have call predecessors, (62), 97 states have return successors, (127), 37 states have call predecessors, (127), 61 states have call successors, (127) [2021-08-27 05:21:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1189 transitions. [2021-08-27 05:21:16,897 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1189 transitions. Word has length 20 [2021-08-27 05:21:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:16,898 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1189 transitions. [2021-08-27 05:21:16,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:21:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1189 transitions. [2021-08-27 05:21:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:21:16,899 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:16,899 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:16,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-08-27 05:21:17,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:17,106 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash -389155418, now seen corresponding path program 2 times [2021-08-27 05:21:17,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:17,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525620424] [2021-08-27 05:21:17,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:21:17,107 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:17,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:17,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:17,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 05:21:17,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:21:17,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:21:17,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:21:17,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 05:21:17,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 05:21:17,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:17,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525620424] [2021-08-27 05:21:17,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525620424] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:17,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:17,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-27 05:21:17,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034202599] [2021-08-27 05:21:17,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:21:17,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:21:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:21:17,591 INFO L87 Difference]: Start difference. First operand 837 states and 1189 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 05:21:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:17,774 INFO L93 Difference]: Finished difference Result 1159 states and 1597 transitions. [2021-08-27 05:21:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:21:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2021-08-27 05:21:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:17,778 INFO L225 Difference]: With dead ends: 1159 [2021-08-27 05:21:17,778 INFO L226 Difference]: Without dead ends: 1159 [2021-08-27 05:21:17,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 110.5ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:21:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-08-27 05:21:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1147. [2021-08-27 05:21:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 908 states have (on average 1.4405286343612336) internal successors, (1308), 1016 states have internal predecessors, (1308), 82 states have call successors, (82), 82 states have call predecessors, (82), 145 states have return successors, (195), 49 states have call predecessors, (195), 81 states have call successors, (195) [2021-08-27 05:21:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1585 transitions. [2021-08-27 05:21:17,804 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1585 transitions. Word has length 27 [2021-08-27 05:21:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:17,804 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 1585 transitions. [2021-08-27 05:21:17,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 05:21:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1585 transitions. [2021-08-27 05:21:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:21:17,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:17,807 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:18,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:18,015 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1024254868, now seen corresponding path program 1 times [2021-08-27 05:21:18,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:18,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128603852] [2021-08-27 05:21:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:18,016 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:18,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:18,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 05:21:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:18,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:21:18,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:18,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:18,829 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:18,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128603852] [2021-08-27 05:21:18,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128603852] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:18,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:18,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-27 05:21:18,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412129389] [2021-08-27 05:21:18,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:21:18,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:21:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:21:18,830 INFO L87 Difference]: Start difference. First operand 1147 states and 1585 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:21:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:19,410 INFO L93 Difference]: Finished difference Result 1680 states and 2280 transitions. [2021-08-27 05:21:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:21:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2021-08-27 05:21:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:19,415 INFO L225 Difference]: With dead ends: 1680 [2021-08-27 05:21:19,415 INFO L226 Difference]: Without dead ends: 1680 [2021-08-27 05:21:19,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 224.3ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-08-27 05:21:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2021-08-27 05:21:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1467. [2021-08-27 05:21:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1157 states have (on average 1.4079515989628348) internal successors, (1629), 1297 states have internal predecessors, (1629), 107 states have call successors, (107), 107 states have call predecessors, (107), 191 states have return successors, (265), 63 states have call predecessors, (265), 106 states have call successors, (265) [2021-08-27 05:21:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2001 transitions. [2021-08-27 05:21:19,450 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2001 transitions. Word has length 29 [2021-08-27 05:21:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:19,450 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 2001 transitions. [2021-08-27 05:21:19,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:21:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2001 transitions. [2021-08-27 05:21:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:21:19,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:19,451 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:19,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:19,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:19,659 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1836404925, now seen corresponding path program 1 times [2021-08-27 05:21:19,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:19,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583664481] [2021-08-27 05:21:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:19,660 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:19,660 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:19,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 05:21:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:19,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:21:19,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:21:20,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:20,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:20,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583664481] [2021-08-27 05:21:20,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583664481] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:20,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:20,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-08-27 05:21:20,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923285695] [2021-08-27 05:21:20,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:21:20,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:21:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:21:20,314 INFO L87 Difference]: Start difference. First operand 1467 states and 2001 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:21:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:20,980 INFO L93 Difference]: Finished difference Result 1681 states and 2135 transitions. [2021-08-27 05:21:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:21:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-08-27 05:21:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:20,984 INFO L225 Difference]: With dead ends: 1681 [2021-08-27 05:21:20,984 INFO L226 Difference]: Without dead ends: 1497 [2021-08-27 05:21:20,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 330.7ms TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2021-08-27 05:21:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-08-27 05:21:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1379. [2021-08-27 05:21:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1071 states have (on average 1.373482726423903) internal successors, (1471), 1209 states have internal predecessors, (1471), 107 states have call successors, (107), 107 states have call predecessors, (107), 189 states have return successors, (237), 63 states have call predecessors, (237), 106 states have call successors, (237) [2021-08-27 05:21:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1815 transitions. [2021-08-27 05:21:21,010 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1815 transitions. Word has length 30 [2021-08-27 05:21:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:21,010 INFO L470 AbstractCegarLoop]: Abstraction has 1379 states and 1815 transitions. [2021-08-27 05:21:21,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:21:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1815 transitions. [2021-08-27 05:21:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:21:21,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:21,012 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:21,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:21,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:21,220 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash -746793865, now seen corresponding path program 2 times [2021-08-27 05:21:21,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:21,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012870162] [2021-08-27 05:21:21,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:21:21,221 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:21,221 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:21,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 05:21:21,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:21:21,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:21:21,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:21:21,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 05:21:21,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:21:21,996 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:21,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012870162] [2021-08-27 05:21:21,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012870162] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:21,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:21,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-08-27 05:21:21,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700237216] [2021-08-27 05:21:21,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:21:21,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:21,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:21:21,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:21:21,997 INFO L87 Difference]: Start difference. First operand 1379 states and 1815 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 05:21:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:22,833 INFO L93 Difference]: Finished difference Result 2266 states and 3046 transitions. [2021-08-27 05:21:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:21:22,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2021-08-27 05:21:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:22,840 INFO L225 Difference]: With dead ends: 2266 [2021-08-27 05:21:22,840 INFO L226 Difference]: Without dead ends: 2170 [2021-08-27 05:21:22,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 336.3ms TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2021-08-27 05:21:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2021-08-27 05:21:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1993. [2021-08-27 05:21:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1543 states have (on average 1.404406999351912) internal successors, (2167), 1753 states have internal predecessors, (2167), 165 states have call successors, (165), 153 states have call predecessors, (165), 273 states have return successors, (421), 87 states have call predecessors, (421), 164 states have call successors, (421) [2021-08-27 05:21:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2753 transitions. [2021-08-27 05:21:22,883 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2753 transitions. Word has length 39 [2021-08-27 05:21:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:22,883 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 2753 transitions. [2021-08-27 05:21:22,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 05:21:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2753 transitions. [2021-08-27 05:21:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:21:22,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:22,885 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:22,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:23,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:23,093 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:23,093 INFO L82 PathProgramCache]: Analyzing trace with hash -268124004, now seen corresponding path program 1 times [2021-08-27 05:21:23,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:23,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367756910] [2021-08-27 05:21:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:23,094 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:23,095 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:23,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 05:21:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 05:21:23,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 05:21:23,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:23,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:23,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367756910] [2021-08-27 05:21:23,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367756910] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:23,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:23,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2021-08-27 05:21:23,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881086157] [2021-08-27 05:21:23,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:21:23,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:23,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:21:23,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:21:23,962 INFO L87 Difference]: Start difference. First operand 1993 states and 2753 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 05:21:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:25,013 INFO L93 Difference]: Finished difference Result 2261 states and 2959 transitions. [2021-08-27 05:21:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 05:21:25,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-08-27 05:21:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:25,020 INFO L225 Difference]: With dead ends: 2261 [2021-08-27 05:21:25,021 INFO L226 Difference]: Without dead ends: 2089 [2021-08-27 05:21:25,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 503.1ms TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 05:21:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-08-27 05:21:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1917. [2021-08-27 05:21:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1469 states have (on average 1.3839346494213751) internal successors, (2033), 1677 states have internal predecessors, (2033), 165 states have call successors, (165), 153 states have call predecessors, (165), 271 states have return successors, (393), 87 states have call predecessors, (393), 164 states have call successors, (393) [2021-08-27 05:21:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2591 transitions. [2021-08-27 05:21:25,061 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2591 transitions. Word has length 39 [2021-08-27 05:21:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:25,061 INFO L470 AbstractCegarLoop]: Abstraction has 1917 states and 2591 transitions. [2021-08-27 05:21:25,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 05:21:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2591 transitions. [2021-08-27 05:21:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 05:21:25,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:25,062 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:25,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:25,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:25,278 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1040706548, now seen corresponding path program 1 times [2021-08-27 05:21:25,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:25,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59343470] [2021-08-27 05:21:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:25,279 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:25,279 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 05:21:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:25,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 05:21:25,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:21:26,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:27,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:27,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59343470] [2021-08-27 05:21:27,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59343470] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:27,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:27,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2021-08-27 05:21:27,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801304422] [2021-08-27 05:21:27,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 05:21:27,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 05:21:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-08-27 05:21:27,256 INFO L87 Difference]: Start difference. First operand 1917 states and 2591 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-27 05:21:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:30,898 INFO L93 Difference]: Finished difference Result 3752 states and 4898 transitions. [2021-08-27 05:21:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-27 05:21:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 45 [2021-08-27 05:21:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:30,909 INFO L225 Difference]: With dead ends: 3752 [2021-08-27 05:21:30,909 INFO L226 Difference]: Without dead ends: 3716 [2021-08-27 05:21:30,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 2129.7ms TimeCoverageRelationStatistics Valid=977, Invalid=4279, Unknown=0, NotChecked=0, Total=5256 [2021-08-27 05:21:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2021-08-27 05:21:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3017. [2021-08-27 05:21:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 2325 states have (on average 1.3320430107526882) internal successors, (3097), 2625 states have internal predecessors, (3097), 257 states have call successors, (257), 257 states have call predecessors, (257), 423 states have return successors, (665), 135 states have call predecessors, (665), 256 states have call successors, (665) [2021-08-27 05:21:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4019 transitions. [2021-08-27 05:21:30,961 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4019 transitions. Word has length 45 [2021-08-27 05:21:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:30,962 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 4019 transitions. [2021-08-27 05:21:30,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-27 05:21:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4019 transitions. [2021-08-27 05:21:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 05:21:30,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:30,963 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:31,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:31,171 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1515964261, now seen corresponding path program 1 times [2021-08-27 05:21:31,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:31,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062113077] [2021-08-27 05:21:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:31,171 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:31,174 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:31,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 05:21:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:31,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 05:21:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:21:31,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:32,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:32,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062113077] [2021-08-27 05:21:32,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062113077] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:32,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:32,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2021-08-27 05:21:32,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597126647] [2021-08-27 05:21:32,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:21:32,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:21:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:21:32,326 INFO L87 Difference]: Start difference. First operand 3017 states and 4019 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 05:21:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:33,699 INFO L93 Difference]: Finished difference Result 4090 states and 5250 transitions. [2021-08-27 05:21:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:21:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2021-08-27 05:21:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:33,712 INFO L225 Difference]: With dead ends: 4090 [2021-08-27 05:21:33,712 INFO L226 Difference]: Without dead ends: 3950 [2021-08-27 05:21:33,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 651.4ms TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 05:21:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-08-27 05:21:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3716. [2021-08-27 05:21:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 2853 states have (on average 1.3126533473536628) internal successors, (3745), 3219 states have internal predecessors, (3745), 326 states have call successors, (326), 326 states have call predecessors, (326), 525 states have return successors, (779), 171 states have call predecessors, (779), 325 states have call successors, (779) [2021-08-27 05:21:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 4850 transitions. [2021-08-27 05:21:33,775 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 4850 transitions. Word has length 48 [2021-08-27 05:21:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:33,775 INFO L470 AbstractCegarLoop]: Abstraction has 3716 states and 4850 transitions. [2021-08-27 05:21:33,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 05:21:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 4850 transitions. [2021-08-27 05:21:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 05:21:33,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:33,776 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:33,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:33,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:33,987 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 574627678, now seen corresponding path program 1 times [2021-08-27 05:21:33,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:33,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287691597] [2021-08-27 05:21:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:33,989 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:33,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:33,989 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:33,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 05:21:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:21:34,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 05:21:34,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-27 05:21:34,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:21:35,313 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:35,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287691597] [2021-08-27 05:21:35,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287691597] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:35,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:35,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 22 [2021-08-27 05:21:35,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262615237] [2021-08-27 05:21:35,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 05:21:35,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 05:21:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:21:35,315 INFO L87 Difference]: Start difference. First operand 3716 states and 4850 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 05:21:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:37,076 INFO L93 Difference]: Finished difference Result 4249 states and 5455 transitions. [2021-08-27 05:21:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 05:21:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 59 [2021-08-27 05:21:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:37,090 INFO L225 Difference]: With dead ends: 4249 [2021-08-27 05:21:37,090 INFO L226 Difference]: Without dead ends: 4177 [2021-08-27 05:21:37,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 860.5ms TimeCoverageRelationStatistics Valid=493, Invalid=1957, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:21:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2021-08-27 05:21:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4017. [2021-08-27 05:21:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3083 states have (on average 1.3100875770353553) internal successors, (4039), 3485 states have internal predecessors, (4039), 349 states have call successors, (349), 349 states have call predecessors, (349), 573 states have return successors, (833), 183 states have call predecessors, (833), 348 states have call successors, (833) [2021-08-27 05:21:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5221 transitions. [2021-08-27 05:21:37,154 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5221 transitions. Word has length 59 [2021-08-27 05:21:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:37,154 INFO L470 AbstractCegarLoop]: Abstraction has 4017 states and 5221 transitions. [2021-08-27 05:21:37,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 05:21:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5221 transitions. [2021-08-27 05:21:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 05:21:37,155 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:37,155 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:37,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:37,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:37,365 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:37,365 INFO L82 PathProgramCache]: Analyzing trace with hash 517554629, now seen corresponding path program 2 times [2021-08-27 05:21:37,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:37,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680862944] [2021-08-27 05:21:37,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:21:37,366 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:37,366 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:37,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 05:21:37,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:21:37,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:21:37,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 05:21:37,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:21:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-27 05:21:38,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:21:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:21:40,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:21:40,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680862944] [2021-08-27 05:21:40,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680862944] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:21:40,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:21:40,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2021-08-27 05:21:40,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067534363] [2021-08-27 05:21:40,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-27 05:21:40,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:21:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-27 05:21:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:21:40,436 INFO L87 Difference]: Start difference. First operand 4017 states and 5221 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-27 05:21:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:21:46,159 INFO L93 Difference]: Finished difference Result 7214 states and 9438 transitions. [2021-08-27 05:21:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-27 05:21:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 70 [2021-08-27 05:21:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:21:46,179 INFO L225 Difference]: With dead ends: 7214 [2021-08-27 05:21:46,179 INFO L226 Difference]: Without dead ends: 7154 [2021-08-27 05:21:46,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3653.8ms TimeCoverageRelationStatistics Valid=1482, Invalid=6890, Unknown=0, NotChecked=0, Total=8372 [2021-08-27 05:21:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2021-08-27 05:21:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 5071. [2021-08-27 05:21:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 3907 states have (on average 1.3112362426414128) internal successors, (5123), 4429 states have internal predecessors, (5123), 421 states have call successors, (421), 421 states have call predecessors, (421), 731 states have return successors, (1057), 221 states have call predecessors, (1057), 420 states have call successors, (1057) [2021-08-27 05:21:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 6601 transitions. [2021-08-27 05:21:46,284 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 6601 transitions. Word has length 70 [2021-08-27 05:21:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:21:46,285 INFO L470 AbstractCegarLoop]: Abstraction has 5071 states and 6601 transitions. [2021-08-27 05:21:46,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-27 05:21:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 6601 transitions. [2021-08-27 05:21:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 05:21:46,287 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:21:46,287 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:21:46,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:46,497 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:21:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:21:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1608789574, now seen corresponding path program 1 times [2021-08-27 05:21:46,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:21:46,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136905842] [2021-08-27 05:21:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:21:46,498 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:21:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:21:46,498 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:21:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 05:21:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:21:47,210 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:21:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:21:47,417 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 05:21:47,417 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:21:47,418 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION [2021-08-27 05:21:47,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:47,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:21:47,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 05:21:47,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:21:47,635 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:21:47,663 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:21:47,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:21:47 BoogieIcfgContainer [2021-08-27 05:21:47,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:21:47,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:21:47,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:21:47,695 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:21:47,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:21:10" (3/4) ... [2021-08-27 05:21:47,699 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:21:47,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:21:47,700 INFO L168 Benchmark]: Toolchain (without parser) took 37825.33 ms. Allocated memory was 60.8 MB in the beginning and 413.1 MB in the end (delta: 352.3 MB). Free memory was 38.8 MB in the beginning and 150.2 MB in the end (delta: -111.4 MB). Peak memory consumption was 241.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:47,701 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:21:47,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.87 ms. Allocated memory is still 60.8 MB. Free memory was 38.5 MB in the beginning and 36.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:47,701 INFO L168 Benchmark]: Boogie Preprocessor took 64.30 ms. Allocated memory is still 60.8 MB. Free memory was 36.6 MB in the beginning and 33.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:47,701 INFO L168 Benchmark]: RCFGBuilder took 562.62 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 33.4 MB in the beginning and 34.5 MB in the end (delta: -1.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:47,702 INFO L168 Benchmark]: TraceAbstraction took 36832.86 ms. Allocated memory was 75.5 MB in the beginning and 413.1 MB in the end (delta: 337.6 MB). Free memory was 34.1 MB in the beginning and 150.2 MB in the end (delta: -116.1 MB). Peak memory consumption was 222.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:21:47,702 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 413.1 MB. Free memory is still 150.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:21:47,703 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 356.87 ms. Allocated memory is still 60.8 MB. Free memory was 38.5 MB in the beginning and 36.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.30 ms. Allocated memory is still 60.8 MB. Free memory was 36.6 MB in the beginning and 33.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 562.62 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 33.4 MB in the beginning and 34.5 MB in the end (delta: -1.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 36832.86 ms. Allocated memory was 75.5 MB in the beginning and 413.1 MB in the end (delta: 337.6 MB). Free memory was 34.1 MB in the beginning and 150.2 MB in the end (delta: -116.1 MB). Peak memory consumption was 222.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.75 ms. Allocated memory is still 413.1 MB. Free memory is still 150.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=18, \old(pc4)=28, \old(res4)=22, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 36736.6ms, OverallIterations: 19, TraceHistogramMax: 6, EmptinessCheckTime: 21.7ms, AutomataDifference: 17497.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2412 SDtfs, 14226 SDslu, 3700 SDs, 0 SdLazy, 10230 SolverSat, 3710 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7957.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4579 ImplicationChecksByTransitivity, 9137.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5071occurred in iteration=18, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 573.0ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4146 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 337.6ms SsaConstructionTime, 1016.8ms SatisfiabilityAnalysisTime, 9056.8ms InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 956 ConstructedInterpolants, 0 QuantifiedInterpolants, 5575 SizeOfPredicates, 63 NumberOfNonLiveVariables, 4143 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 36 InterpolantComputations, 14 PerfectInterpolantSequences, 291/834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 05:21:47,738 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...