./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-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/test-0232-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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/test-0232-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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:24:40,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:24:40,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:24:40,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:24:40,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:24:40,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:24:40,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:24:40,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:24:40,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:24:40,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:24:40,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:24:40,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:24:40,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:24:40,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:24:40,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:24:40,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:24:40,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:24:40,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:24:40,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:24:40,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:24:40,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:24:40,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:24:40,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:24:40,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:24:40,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:24:40,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:24:40,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:24:40,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:24:40,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:24:40,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:24:40,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:24:40,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:24:40,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:24:40,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:24:40,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:24:40,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:24:40,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:24:40,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:24:40,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:24:40,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:24:40,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:24:40,597 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:24:40,625 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:24:40,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:24:40,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:24:40,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:24:40,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:24:40,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:24:40,628 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:24:40,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:24:40,628 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:24:40,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:24:40,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:24:40,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:24:40,630 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:24:40,631 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:24:40,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:24:40,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:24:40,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:24:40,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:24:40,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:24:40,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:24:40,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:24:40,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:24:40,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:24:40,632 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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2021-08-27 05:24:40,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:24:40,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:24:40,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:24:40,910 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:24:40,910 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:24:40,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2021-08-27 05:24:40,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b15bfe/b35d69b4dea64bc7b7d28356ac493584/FLAG1fbb50685 [2021-08-27 05:24:41,393 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:24:41,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2021-08-27 05:24:41,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b15bfe/b35d69b4dea64bc7b7d28356ac493584/FLAG1fbb50685 [2021-08-27 05:24:41,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b15bfe/b35d69b4dea64bc7b7d28356ac493584 [2021-08-27 05:24:41,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:24:41,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:24:41,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:24:41,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:24:41,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:24:41,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:24:41" (1/1) ... [2021-08-27 05:24:41,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daa986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:41, skipping insertion in model container [2021-08-27 05:24:41,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:24:41" (1/1) ... [2021-08-27 05:24:41,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:24:41,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:24:42,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:24:42,016 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:24:42,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:24:42,075 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:24:42,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42 WrapperNode [2021-08-27 05:24:42,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:24:42,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:24:42,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:24:42,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:24:42,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:24:42,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:24:42,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:24:42,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:24:42,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (1/1) ... [2021-08-27 05:24:42,177 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:24:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:24:42,223 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:24:42,237 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:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:24:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:24:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:24:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:24:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-08-27 05:24:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:24:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:24:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:24:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:24:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:24:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:24:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:24:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:24:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:24:42,287 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:24:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-08-27 05:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:24:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:24:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:24:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:24:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 05:24:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:24:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:24:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 05:24:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:24:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 05:24:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 05:24:42,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:24:42,814 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:24:42,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:42 BoogieIcfgContainer [2021-08-27 05:24:42,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:24:42,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:24:42,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:24:42,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:24:42,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:24:41" (1/3) ... [2021-08-27 05:24:42,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cab5b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:24:42, skipping insertion in model container [2021-08-27 05:24:42,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:42" (2/3) ... [2021-08-27 05:24:42,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cab5b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:24:42, skipping insertion in model container [2021-08-27 05:24:42,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:42" (3/3) ... [2021-08-27 05:24:42,833 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2021-08-27 05:24:42,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:24:42,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-08-27 05:24:42,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:24:42,882 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:24:42,883 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-08-27 05:24:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:24:42,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:42,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:42,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 726856395, now seen corresponding path program 1 times [2021-08-27 05:24:42,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:42,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200193231] [2021-08-27 05:24:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:42,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,152 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:24:43,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:43,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200193231] [2021-08-27 05:24:43,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200193231] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:43,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:43,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:24:43,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408760820] [2021-08-27 05:24:43,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:24:43,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:24:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:24:43,186 INFO L87 Difference]: Start difference. First operand has 89 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:24:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:43,289 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-08-27 05:24:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:24:43,290 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:24:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:43,295 INFO L225 Difference]: With dead ends: 89 [2021-08-27 05:24:43,295 INFO L226 Difference]: Without dead ends: 86 [2021-08-27 05:24:43,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:24:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-27 05:24:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-08-27 05:24:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 40 states have (on average 2.1) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-08-27 05:24:43,317 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2021-08-27 05:24:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:43,317 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-08-27 05:24:43,317 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:24:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-08-27 05:24:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:24:43,318 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:43,318 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:43,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 05:24:43,318 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting appendErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1057814912, now seen corresponding path program 1 times [2021-08-27 05:24:43,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:43,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155332668] [2021-08-27 05:24:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:43,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,396 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:24:43,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:43,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155332668] [2021-08-27 05:24:43,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155332668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:43,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:43,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:24:43,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936595836] [2021-08-27 05:24:43,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:24:43,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:24:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:24:43,399 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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:24:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:43,564 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2021-08-27 05:24:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:24:43,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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 9 [2021-08-27 05:24:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:43,570 INFO L225 Difference]: With dead ends: 78 [2021-08-27 05:24:43,570 INFO L226 Difference]: Without dead ends: 78 [2021-08-27 05:24:43,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-27 05:24:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-08-27 05:24:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 1.9) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-08-27 05:24:43,590 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 9 [2021-08-27 05:24:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:43,590 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-08-27 05:24:43,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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:24:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-08-27 05:24:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:24:43,592 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:43,592 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:43,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 05:24:43,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1057814913, now seen corresponding path program 1 times [2021-08-27 05:24:43,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:43,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747280260] [2021-08-27 05:24:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:43,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:43,729 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:24:43,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:43,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747280260] [2021-08-27 05:24:43,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747280260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:43,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:43,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:24:43,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189318619] [2021-08-27 05:24:43,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:24:43,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:24:43,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:24:43,735 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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:24:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:43,948 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-08-27 05:24:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:24:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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 9 [2021-08-27 05:24:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:43,958 INFO L225 Difference]: With dead ends: 96 [2021-08-27 05:24:43,958 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 05:24:43,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 05:24:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2021-08-27 05:24:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 77 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-08-27 05:24:43,972 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 9 [2021-08-27 05:24:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:43,972 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-08-27 05:24:43,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 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:24:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-08-27 05:24:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:24:43,972 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:43,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:43,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 05:24:43,973 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1567476021, now seen corresponding path program 1 times [2021-08-27 05:24:43,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:43,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95287635] [2021-08-27 05:24:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:43,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,043 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:24:44,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:44,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95287635] [2021-08-27 05:24:44,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95287635] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:44,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:44,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:24:44,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209064134] [2021-08-27 05:24:44,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:24:44,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:24:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:24:44,046 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:44,145 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2021-08-27 05:24:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:24:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2021-08-27 05:24:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:44,146 INFO L225 Difference]: With dead ends: 79 [2021-08-27 05:24:44,146 INFO L226 Difference]: Without dead ends: 79 [2021-08-27 05:24:44,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:24:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-27 05:24:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-08-27 05:24:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.653061224489796) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2021-08-27 05:24:44,149 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 10 [2021-08-27 05:24:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:44,150 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2021-08-27 05:24:44,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2021-08-27 05:24:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:24:44,150 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:44,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:44,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 05:24:44,151 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1567476020, now seen corresponding path program 1 times [2021-08-27 05:24:44,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:44,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298332707] [2021-08-27 05:24:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:44,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,200 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:24:44,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:44,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298332707] [2021-08-27 05:24:44,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298332707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:44,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:44,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:24:44,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262041314] [2021-08-27 05:24:44,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:24:44,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:44,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:24:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:24:44,203 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:44,287 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2021-08-27 05:24:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:24:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2021-08-27 05:24:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:44,288 INFO L225 Difference]: With dead ends: 75 [2021-08-27 05:24:44,288 INFO L226 Difference]: Without dead ends: 75 [2021-08-27 05:24:44,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:24:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-27 05:24:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-08-27 05:24:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2021-08-27 05:24:44,291 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2021-08-27 05:24:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:44,291 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-08-27 05:24:44,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2021-08-27 05:24:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:24:44,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:44,292 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:44,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 05:24:44,292 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1388861269, now seen corresponding path program 1 times [2021-08-27 05:24:44,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:44,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776719292] [2021-08-27 05:24:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:44,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,388 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:24:44,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:44,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776719292] [2021-08-27 05:24:44,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776719292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:44,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:44,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:24:44,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942448001] [2021-08-27 05:24:44,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:24:44,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:24:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:24:44,390 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 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:24:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:44,602 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-08-27 05:24:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:24:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 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 15 [2021-08-27 05:24:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:44,603 INFO L225 Difference]: With dead ends: 86 [2021-08-27 05:24:44,603 INFO L226 Difference]: Without dead ends: 86 [2021-08-27 05:24:44,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 135.3ms TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:24:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-27 05:24:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2021-08-27 05:24:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.490909090909091) internal successors, (82), 75 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2021-08-27 05:24:44,607 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2021-08-27 05:24:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:44,608 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2021-08-27 05:24:44,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 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:24:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2021-08-27 05:24:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 05:24:44,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:44,608 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:44,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 05:24:44,609 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash -104748240, now seen corresponding path program 1 times [2021-08-27 05:24:44,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:44,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349168115] [2021-08-27 05:24:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:44,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,681 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:24:44,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:44,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349168115] [2021-08-27 05:24:44,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349168115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:44,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:44,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:24:44,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823772853] [2021-08-27 05:24:44,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:24:44,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:24:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:44,689 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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:24:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:44,822 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2021-08-27 05:24:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:24:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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 16 [2021-08-27 05:24:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:44,823 INFO L225 Difference]: With dead ends: 81 [2021-08-27 05:24:44,823 INFO L226 Difference]: Without dead ends: 81 [2021-08-27 05:24:44,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:24:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-27 05:24:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2021-08-27 05:24:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5) internal successors, (78), 71 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-08-27 05:24:44,826 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2021-08-27 05:24:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:44,827 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-08-27 05:24:44,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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:24:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-08-27 05:24:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:24:44,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:44,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:44,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 05:24:44,828 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1762060380, now seen corresponding path program 1 times [2021-08-27 05:24:44,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:44,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098209118] [2021-08-27 05:24:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:44,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:44,930 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:24:44,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:44,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098209118] [2021-08-27 05:24:44,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098209118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:44,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:44,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:24:44,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458116332] [2021-08-27 05:24:44,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:24:44,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:24:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:24:44,933 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:45,140 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-08-27 05:24:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:45,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-08-27 05:24:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:45,142 INFO L225 Difference]: With dead ends: 86 [2021-08-27 05:24:45,142 INFO L226 Difference]: Without dead ends: 86 [2021-08-27 05:24:45,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:24:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-27 05:24:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2021-08-27 05:24:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-08-27 05:24:45,145 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 24 [2021-08-27 05:24:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:45,147 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-08-27 05:24:45,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-08-27 05:24:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:24:45,148 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:45,148 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:45,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 05:24:45,148 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1762060381, now seen corresponding path program 1 times [2021-08-27 05:24:45,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:45,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753941751] [2021-08-27 05:24:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:45,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,300 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:24:45,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:45,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753941751] [2021-08-27 05:24:45,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753941751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:45,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:45,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:24:45,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992554784] [2021-08-27 05:24:45,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:24:45,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:24:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:24:45,303 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:45,557 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-08-27 05:24:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-08-27 05:24:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:45,558 INFO L225 Difference]: With dead ends: 88 [2021-08-27 05:24:45,558 INFO L226 Difference]: Without dead ends: 88 [2021-08-27 05:24:45,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:24:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-27 05:24:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2021-08-27 05:24:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 69 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-08-27 05:24:45,562 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2021-08-27 05:24:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:45,563 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-08-27 05:24:45,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-08-27 05:24:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 05:24:45,564 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:45,564 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:45,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 05:24:45,564 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr26ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1143077172, now seen corresponding path program 1 times [2021-08-27 05:24:45,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:45,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815139611] [2021-08-27 05:24:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:45,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,661 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:24:45,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:45,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815139611] [2021-08-27 05:24:45,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815139611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:45,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:45,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:24:45,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441481704] [2021-08-27 05:24:45,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:24:45,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:24:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:45,663 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:45,831 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-08-27 05:24:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 05:24:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:45,832 INFO L225 Difference]: With dead ends: 70 [2021-08-27 05:24:45,832 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 05:24:45,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:24:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 05:24:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 05:24:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.434782608695652) internal successors, (66), 63 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-08-27 05:24:45,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2021-08-27 05:24:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:45,835 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-08-27 05:24:45,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-08-27 05:24:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:24:45,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:45,836 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:45,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 05:24:45,836 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr8ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 450500818, now seen corresponding path program 1 times [2021-08-27 05:24:45,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:45,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783501920] [2021-08-27 05:24:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:45,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:45,930 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:24:45,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:45,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783501920] [2021-08-27 05:24:45,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783501920] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:45,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:45,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:24:45,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969792704] [2021-08-27 05:24:45,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:24:45,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:24:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:45,932 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:46,092 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-08-27 05:24:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-08-27 05:24:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:46,093 INFO L225 Difference]: With dead ends: 69 [2021-08-27 05:24:46,093 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:24:46,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 99.3ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:24:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:24:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:24:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 62 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2021-08-27 05:24:46,096 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 27 [2021-08-27 05:24:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:46,096 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2021-08-27 05:24:46,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2021-08-27 05:24:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:24:46,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:46,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:46,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 05:24:46,097 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1080623549, now seen corresponding path program 1 times [2021-08-27 05:24:46,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:46,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117422256] [2021-08-27 05:24:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:46,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,175 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:24:46,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:46,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117422256] [2021-08-27 05:24:46,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117422256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:46,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:46,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:24:46,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814021808] [2021-08-27 05:24:46,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:24:46,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:24:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:46,178 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:46,377 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-08-27 05:24:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-08-27 05:24:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:46,378 INFO L225 Difference]: With dead ends: 68 [2021-08-27 05:24:46,378 INFO L226 Difference]: Without dead ends: 68 [2021-08-27 05:24:46,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:24:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-27 05:24:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-27 05:24:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.391304347826087) internal successors, (64), 61 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-08-27 05:24:46,380 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2021-08-27 05:24:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:46,380 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-08-27 05:24:46,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-08-27 05:24:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:24:46,381 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:46,381 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] [2021-08-27 05:24:46,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 05:24:46,382 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:46,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1016891037, now seen corresponding path program 1 times [2021-08-27 05:24:46,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:46,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482786154] [2021-08-27 05:24:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:46,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:24:46,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:46,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482786154] [2021-08-27 05:24:46,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482786154] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:24:46,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039204615] [2021-08-27 05:24:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:46,512 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:24:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:24:46,513 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:24:46,532 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:24:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:46,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-27 05:24:46,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:46,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 05:24:46,886 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-08-27 05:24:46,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-08-27 05:24:46,994 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:24:46,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-08-27 05:24:47,116 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:24:47,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2021-08-27 05:24:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:24:47,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039204615] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:24:47,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:24:47,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 05:24:47,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767418295] [2021-08-27 05:24:47,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:24:47,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:47,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:24:47,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:24:47,147 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:24:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:47,804 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2021-08-27 05:24:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:24:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-08-27 05:24:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:47,805 INFO L225 Difference]: With dead ends: 74 [2021-08-27 05:24:47,805 INFO L226 Difference]: Without dead ends: 74 [2021-08-27 05:24:47,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 490.6ms TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-08-27 05:24:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-27 05:24:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2021-08-27 05:24:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 65 states have internal predecessors, (67), 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:24:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-08-27 05:24:47,808 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 29 [2021-08-27 05:24:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:47,808 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-08-27 05:24:47,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:24:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2021-08-27 05:24:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:24:47,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:47,809 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] [2021-08-27 05:24:47,844 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:24:48,027 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,SelfDestructingSolverStorable12 [2021-08-27 05:24:48,027 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1016891038, now seen corresponding path program 1 times [2021-08-27 05:24:48,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:48,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801332042] [2021-08-27 05:24:48,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:48,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:24:48,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:48,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801332042] [2021-08-27 05:24:48,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801332042] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:24:48,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767862476] [2021-08-27 05:24:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:48,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:24:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:24:48,221 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:24:48,267 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:24:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:48,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-27 05:24:48,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:48,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 05:24:48,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 05:24:48,699 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:24:48,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-08-27 05:24:48,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 05:24:48,797 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:24:48,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2021-08-27 05:24:48,808 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:24:48,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2021-08-27 05:24:48,952 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:24:48,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2021-08-27 05:24:48,957 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:24:48,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2021-08-27 05:24:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:24:48,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767862476] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:24:48,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:24:48,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 05:24:48,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207037755] [2021-08-27 05:24:48,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:24:48,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:24:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:24:48,996 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:24:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:49,641 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-08-27 05:24:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 05:24:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-08-27 05:24:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:49,642 INFO L225 Difference]: With dead ends: 73 [2021-08-27 05:24:49,642 INFO L226 Difference]: Without dead ends: 73 [2021-08-27 05:24:49,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 565.4ms TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:24:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-27 05:24:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-08-27 05:24:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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:24:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-08-27 05:24:49,644 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 29 [2021-08-27 05:24:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:49,644 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-08-27 05:24:49,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:24:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2021-08-27 05:24:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:24:49,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:49,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:49,677 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:24:49,845 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,SelfDestructingSolverStorable13 [2021-08-27 05:24:49,845 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash -860408268, now seen corresponding path program 1 times [2021-08-27 05:24:49,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:49,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156794802] [2021-08-27 05:24:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:49,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:49,904 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:24:49,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:49,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156794802] [2021-08-27 05:24:49,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156794802] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:49,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:49,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:24:49,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591281121] [2021-08-27 05:24:49,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:24:49,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:24:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:24:49,906 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:50,039 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2021-08-27 05:24:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:24:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-08-27 05:24:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:50,040 INFO L225 Difference]: With dead ends: 70 [2021-08-27 05:24:50,040 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 05:24:50,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.3ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:24:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 05:24:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 05:24:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 63 states have internal predecessors, (65), 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:24:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2021-08-27 05:24:50,042 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2021-08-27 05:24:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:50,042 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2021-08-27 05:24:50,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:24:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2021-08-27 05:24:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:24:50,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:50,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:50,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 05:24:50,043 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash -902852448, now seen corresponding path program 1 times [2021-08-27 05:24:50,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:50,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601460535] [2021-08-27 05:24:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:50,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,141 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:24:50,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:50,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601460535] [2021-08-27 05:24:50,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601460535] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:50,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:50,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:24:50,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420515496] [2021-08-27 05:24:50,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:24:50,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:24:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:24:50,143 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:50,312 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-27 05:24:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:24:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-08-27 05:24:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:50,313 INFO L225 Difference]: With dead ends: 69 [2021-08-27 05:24:50,314 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:24:50,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:24:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:24:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:24:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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:24:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-08-27 05:24:50,316 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2021-08-27 05:24:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:50,316 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-08-27 05:24:50,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-08-27 05:24:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:24:50,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:50,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:50,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 05:24:50,317 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -902852447, now seen corresponding path program 1 times [2021-08-27 05:24:50,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:50,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430091608] [2021-08-27 05:24:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:50,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:24:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:24:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:50,380 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:24:50,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:24:50,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430091608] [2021-08-27 05:24:50,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430091608] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:50,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:50,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:24:50,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271222943] [2021-08-27 05:24:50,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:24:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:24:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:24:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:24:50,382 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:50,477 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2021-08-27 05:24:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:24:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-08-27 05:24:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:50,478 INFO L225 Difference]: With dead ends: 64 [2021-08-27 05:24:50,478 INFO L226 Difference]: Without dead ends: 64 [2021-08-27 05:24:50,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:24:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-27 05:24:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-08-27 05:24:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.18) internal successors, (59), 57 states have internal predecessors, (59), 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:24:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2021-08-27 05:24:50,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2021-08-27 05:24:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:50,480 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-08-27 05:24:50,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2021-08-27 05:24:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 05:24:50,481 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:50,481 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:50,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 05:24:50,481 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr26ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 281339622, now seen corresponding path program 1 times [2021-08-27 05:24:50,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:24:50,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135703594] [2021-08-27 05:24:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:50,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:24:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:24:50,496 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:24:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:24:50,523 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 05:24:50,524 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:24:50,524 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr26ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:24:50,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 05:24:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 05:24:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION [2021-08-27 05:24:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION [2021-08-27 05:24:50,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION [2021-08-27 05:24:50,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION [2021-08-27 05:24:50,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION [2021-08-27 05:24:50,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 05:24:50,534 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:24:50,541 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:24:50,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:24:50 BoogieIcfgContainer [2021-08-27 05:24:50,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:24:50,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:24:50,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:24:50,552 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:24:50,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:42" (3/4) ... [2021-08-27 05:24:50,554 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:24:50,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:24:50,555 INFO L168 Benchmark]: Toolchain (without parser) took 8814.09 ms. Allocated memory was 69.2 MB in the beginning and 276.8 MB in the end (delta: 207.6 MB). Free memory was 52.0 MB in the beginning and 189.1 MB in the end (delta: -137.0 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:50,555 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:24:50,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.17 ms. Allocated memory is still 69.2 MB. Free memory was 51.8 MB in the beginning and 46.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:50,556 INFO L168 Benchmark]: Boogie Preprocessor took 85.99 ms. Allocated memory is still 69.2 MB. Free memory was 45.9 MB in the beginning and 43.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:50,556 INFO L168 Benchmark]: RCFGBuilder took 644.30 ms. Allocated memory was 69.2 MB in the beginning and 86.0 MB in the end (delta: 16.8 MB). Free memory was 43.2 MB in the beginning and 61.2 MB in the end (delta: -18.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:50,556 INFO L168 Benchmark]: TraceAbstraction took 7735.03 ms. Allocated memory was 86.0 MB in the beginning and 276.8 MB in the end (delta: 190.8 MB). Free memory was 60.7 MB in the beginning and 189.1 MB in the end (delta: -128.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:50,556 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 276.8 MB. Free memory is still 189.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:24:50,557 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.13 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 333.17 ms. Allocated memory is still 69.2 MB. Free memory was 51.8 MB in the beginning and 46.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.99 ms. Allocated memory is still 69.2 MB. Free memory was 45.9 MB in the beginning and 43.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 644.30 ms. Allocated memory was 69.2 MB in the beginning and 86.0 MB in the end (delta: 16.8 MB). Free memory was 43.2 MB in the beginning and 61.2 MB in the end (delta: -18.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7735.03 ms. Allocated memory was 86.0 MB in the beginning and 276.8 MB in the end (delta: 190.8 MB). Free memory was 60.7 MB in the beginning and 189.1 MB in the end (delta: -128.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 16.1 GB. * Witness Printer took 2.71 ms. Allocated memory is still 276.8 MB. Free memory is still 189.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={3:0}] [L541] CALL append(&list) VAL [plist={3:0}] [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, plist={3:0}, plist={3:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, plist={3:0}, plist={3:0}] [L532] EXPR item->next VAL [item={1:0}, item->next={0:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L535] *plist = item VAL [item={1:0}, plist={3:0}, plist={3:0}] [L541] RET append(&list) VAL [list={3:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L544] EXPR list->next VAL [\read(*list)={1:0}, list={3:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={3:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={3:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: 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: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 107 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 7663.7ms, OverallIterations: 18, TraceHistogramMax: 2, EmptinessCheckTime: 29.9ms, AutomataDifference: 3761.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 797 SDtfs, 731 SDslu, 2258 SDs, 0 SdLazy, 3855 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1884.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2127.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 77.6ms AutomataMinimizationTime, 17 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.9ms SsaConstructionTime, 214.6ms SatisfiabilityAnalysisTime, 2519.3ms InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 392 ConstructedInterpolants, 12 QuantifiedInterpolants, 3743 SizeOfPredicates, 32 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 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:24:50,598 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:24:52,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:24:52,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:24:52,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:24:52,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:24:52,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:24:52,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:24:52,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:24:52,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:24:52,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:24:52,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:24:52,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:24:52,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:24:52,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:24:52,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:24:52,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:24:52,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:24:52,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:24:52,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:24:52,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:24:52,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:24:52,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:24:52,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:24:52,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:24:52,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:24:52,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:24:52,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:24:52,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:24:52,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:24:52,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:24:52,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:24:52,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:24:52,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:24:52,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:24:52,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:24:52,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:24:52,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:24:52,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:24:52,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:24:52,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:24:52,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:24:52,674 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:24:52,705 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:24:52,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:24:52,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:24:52,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:24:52,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:24:52,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:24:52,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:24:52,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:24:52,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:24:52,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:24:52,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:24:52,709 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 05:24:52,709 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 05:24:52,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:24:52,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 05:24:52,709 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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2021-08-27 05:24:53,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:24:53,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:24:53,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:24:53,036 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:24:53,037 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:24:53,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2021-08-27 05:24:53,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2188f7b/3cef04a0503743bf9feaae21ebb39abb/FLAG9fe1f99b8 [2021-08-27 05:24:53,574 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:24:53,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2021-08-27 05:24:53,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2188f7b/3cef04a0503743bf9feaae21ebb39abb/FLAG9fe1f99b8 [2021-08-27 05:24:54,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2188f7b/3cef04a0503743bf9feaae21ebb39abb [2021-08-27 05:24:54,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:24:54,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:24:54,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:24:54,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:24:54,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:24:54,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4384ebeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54, skipping insertion in model container [2021-08-27 05:24:54,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:24:54,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:24:54,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:24:54,272 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:24:54,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:24:54,325 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:24:54,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54 WrapperNode [2021-08-27 05:24:54,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:24:54,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:24:54,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:24:54,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:24:54,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:24:54,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:24:54,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:24:54,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:24:54,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (1/1) ... [2021-08-27 05:24:54,371 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:24:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:24:54,400 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:24:54,416 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:24:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:24:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:24:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:24:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:24:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:24:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:24:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:24:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-08-27 05:24:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:24:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:24:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:24:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:24:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:24:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:24:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:24:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:24:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:24:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:24:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:24:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:24:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:24:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:24:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:24:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:24:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:24:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:24:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:24:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:24:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:24:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:24:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:24:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:24:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:24:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:24:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:24:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:24:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:24:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:24:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:24:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:24:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:24:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:24:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:24:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:24:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:24:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:24:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:24:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:24:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:24:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:24:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:24:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:24:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:24:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:24:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:24:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:24:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:24:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:24:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:24:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:24:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:24:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:24:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:24:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:24:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:24:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:24:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-08-27 05:24:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:24:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:24:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:24:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:24:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 05:24:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:24:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:24:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 05:24:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:24:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:24:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 05:24:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 05:24:54,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:24:54,954 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:24:54,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:54 BoogieIcfgContainer [2021-08-27 05:24:54,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:24:54,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:24:54,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:24:54,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:24:54,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:24:54" (1/3) ... [2021-08-27 05:24:54,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536fad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:24:54, skipping insertion in model container [2021-08-27 05:24:54,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:24:54" (2/3) ... [2021-08-27 05:24:54,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536fad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:24:54, skipping insertion in model container [2021-08-27 05:24:54,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:54" (3/3) ... [2021-08-27 05:24:54,959 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2021-08-27 05:24:54,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:24:54,962 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-08-27 05:24:54,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:24:54,990 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:24:54,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-08-27 05:24:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:24:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:24:55,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:55,002 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:55,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1666262251, now seen corresponding path program 1 times [2021-08-27 05:24:55,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:24:55,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724352882] [2021-08-27 05:24:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:55,019 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:24:55,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:24:55,046 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:24:55,059 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:24:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:55,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 05:24:55,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:55,228 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:24:55,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:24:55,258 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:24:55,259 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:24:55,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724352882] [2021-08-27 05:24:55,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724352882] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:55,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:55,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:24:55,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315143712] [2021-08-27 05:24:55,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 05:24:55,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:24:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 05:24:55,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:24:55,279 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:24:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:55,294 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-08-27 05:24:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 05:24:55,295 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:24:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:55,301 INFO L225 Difference]: With dead ends: 88 [2021-08-27 05:24:55,301 INFO L226 Difference]: Without dead ends: 85 [2021-08-27 05:24:55,302 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:24:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-27 05:24:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-08-27 05:24:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 39 states have (on average 2.128205128205128) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-08-27 05:24:55,337 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2021-08-27 05:24:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:55,337 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-08-27 05:24:55,337 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:24:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-08-27 05:24:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:24:55,338 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:55,338 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:55,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-27 05:24:55,544 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:24:55,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting appendErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 114625428, now seen corresponding path program 1 times [2021-08-27 05:24:55,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:24:55,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57893442] [2021-08-27 05:24:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:55,551 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:24:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:24:55,552 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:24:55,553 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:24:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:55,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 05:24:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:55,708 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:24:55,753 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 05:24:55,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-08-27 05:24:55,782 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:24:55,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:24:55,832 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:24:55,833 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:24:55,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57893442] [2021-08-27 05:24:55,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57893442] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:55,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:55,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 05:24:55,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402773518] [2021-08-27 05:24:55,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:24:55,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:24:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:24:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:24:55,843 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:24:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:56,076 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-08-27 05:24:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:24:56,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2021-08-27 05:24:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:56,077 INFO L225 Difference]: With dead ends: 77 [2021-08-27 05:24:56,077 INFO L226 Difference]: Without dead ends: 77 [2021-08-27 05:24:56,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.3ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:24:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-08-27 05:24:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-08-27 05:24:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:24:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-08-27 05:24:56,082 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 9 [2021-08-27 05:24:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:56,082 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-08-27 05:24:56,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:24:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-08-27 05:24:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:24:56,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:56,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:56,092 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:24:56,285 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:24:56,286 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:24:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 114625429, now seen corresponding path program 1 times [2021-08-27 05:24:56,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:24:56,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237628717] [2021-08-27 05:24:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:56,287 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:24:56,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:24:56,289 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:24:56,291 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:24:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:24:56,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 05:24:56,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:56,442 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:24:56,446 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:24:56,508 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:24:56,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2021-08-27 05:24:56,514 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:24:56,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-08-27 05:24:56,534 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:24:56,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:24:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:24:57,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:24:57,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237628717] [2021-08-27 05:24:57,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237628717] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:24:57,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:24:57,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 05:24:57,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668902567] [2021-08-27 05:24:57,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:24:57,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:24:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:24:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:24:57,165 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:07,961 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-08-27 05:25:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:07,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 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:25:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:07,964 INFO L225 Difference]: With dead ends: 96 [2021-08-27 05:25:07,964 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 05:25:07,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 590.4ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:25:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 05:25:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-08-27 05:25:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2021-08-27 05:25:07,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2021-08-27 05:25:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:07,969 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2021-08-27 05:25:07,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2021-08-27 05:25:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:25:07,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:07,970 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:07,994 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:25:08,192 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:25:08,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash -741578931, now seen corresponding path program 1 times [2021-08-27 05:25:08,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:08,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56939332] [2021-08-27 05:25:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:08,194 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:08,196 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:25:08,197 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:25:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:25:08,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:08,386 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:25:08,407 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:25:08,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:08,476 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:25:08,476 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:08,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56939332] [2021-08-27 05:25:08,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56939332] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:08,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:08,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:25:08,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913876576] [2021-08-27 05:25:08,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:25:08,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:25:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:08,479 INFO L87 Difference]: Start difference. First operand 78 states and 84 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:25:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:08,610 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-08-27 05:25:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:25:08,611 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 10 [2021-08-27 05:25:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:08,612 INFO L225 Difference]: With dead ends: 74 [2021-08-27 05:25:08,612 INFO L226 Difference]: Without dead ends: 74 [2021-08-27 05:25:08,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-27 05:25:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-27 05:25:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-08-27 05:25:08,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2021-08-27 05:25:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:08,615 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-08-27 05:25:08,615 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:25:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-08-27 05:25:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:25:08,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:08,616 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:08,640 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:25:08,822 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:25:08,822 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -741578932, now seen corresponding path program 1 times [2021-08-27 05:25:08,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:08,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122065580] [2021-08-27 05:25:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:08,823 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:08,832 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:25:08,833 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:25:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:08,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:25:08,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:08,991 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:25:09,006 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:25:09,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:09,036 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:25:09,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:09,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122065580] [2021-08-27 05:25:09,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122065580] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:09,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:09,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:25:09,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136296131] [2021-08-27 05:25:09,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:25:09,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:25:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:25:09,044 INFO L87 Difference]: Start difference. First operand 74 states and 80 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, (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:25:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:09,137 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-08-27 05:25:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:25:09,137 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, (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 10 [2021-08-27 05:25:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:09,138 INFO L225 Difference]: With dead ends: 70 [2021-08-27 05:25:09,138 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 05:25:09,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:25:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 05:25:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 05:25:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2021-08-27 05:25:09,141 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2021-08-27 05:25:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:09,141 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2021-08-27 05:25:09,141 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, (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:25:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2021-08-27 05:25:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:25:09,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:09,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:09,150 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:25:09,350 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:25:09,350 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash -164729953, now seen corresponding path program 1 times [2021-08-27 05:25:09,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:09,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902838688] [2021-08-27 05:25:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:09,351 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:09,352 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:25:09,354 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:25:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:09,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:25:09,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:09,630 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:09,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2021-08-27 05:25:09,648 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:09,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2021-08-27 05:25:09,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 05:25:09,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 05:25:09,750 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:25:09,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:09,851 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:25:09,851 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:09,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902838688] [2021-08-27 05:25:09,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902838688] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:09,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:09,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2021-08-27 05:25:09,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346466825] [2021-08-27 05:25:09,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:09,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:09,853 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:25:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:10,270 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2021-08-27 05:25:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:25:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:25:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:10,271 INFO L225 Difference]: With dead ends: 82 [2021-08-27 05:25:10,271 INFO L226 Difference]: Without dead ends: 82 [2021-08-27 05:25:10,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 255.4ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:25:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-27 05:25:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2021-08-27 05:25:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-08-27 05:25:10,276 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2021-08-27 05:25:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:10,276 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-08-27 05:25:10,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:25:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-08-27 05:25:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 05:25:10,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:10,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:10,301 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:25:10,484 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:25:10,484 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 486538853, now seen corresponding path program 1 times [2021-08-27 05:25:10,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:10,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164811542] [2021-08-27 05:25:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:10,488 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:10,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:10,489 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:25:10,489 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:25:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:10,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:25:10,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:10,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 05:25:10,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-08-27 05:25:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:10,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:10,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-27 05:25:11,077 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 05:25:11,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-08-27 05:25:11,175 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:25:11,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:11,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164811542] [2021-08-27 05:25:11,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164811542] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:11,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:11,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-08-27 05:25:11,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930518142] [2021-08-27 05:25:11,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:11,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:11,177 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:11,542 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2021-08-27 05:25:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-08-27 05:25:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:11,543 INFO L225 Difference]: With dead ends: 85 [2021-08-27 05:25:11,543 INFO L226 Difference]: Without dead ends: 85 [2021-08-27 05:25:11,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:25:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-27 05:25:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2021-08-27 05:25:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-08-27 05:25:11,546 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2021-08-27 05:25:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:11,548 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-08-27 05:25:11,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-08-27 05:25:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 05:25:11,549 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:11,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:11,558 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:25:11,756 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:25:11,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 486538854, now seen corresponding path program 1 times [2021-08-27 05:25:11,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:11,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953799129] [2021-08-27 05:25:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:11,758 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:11,759 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:25:11,760 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:25:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:11,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 05:25:11,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:12,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 05:25:12,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 05:25:12,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-08-27 05:25:12,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-08-27 05:25:12,230 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:25:12,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:12,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2021-08-27 05:25:12,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2021-08-27 05:25:12,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-08-27 05:25:12,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 05:25:13,134 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:25:13,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:13,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953799129] [2021-08-27 05:25:13,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953799129] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:13,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:13,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-08-27 05:25:13,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220877131] [2021-08-27 05:25:13,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:25:13,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:25:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:25:13,136 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 05:25:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:14,010 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-08-27 05:25:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2021-08-27 05:25:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:14,011 INFO L225 Difference]: With dead ends: 87 [2021-08-27 05:25:14,011 INFO L226 Difference]: Without dead ends: 87 [2021-08-27 05:25:14,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 367.3ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:25:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-08-27 05:25:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2021-08-27 05:25:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-08-27 05:25:14,014 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2021-08-27 05:25:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:14,014 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-08-27 05:25:14,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 05:25:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-08-27 05:25:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 05:25:14,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:14,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:14,024 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:25:14,215 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:25:14,216 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr26ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -567430243, now seen corresponding path program 1 times [2021-08-27 05:25:14,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:14,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331309395] [2021-08-27 05:25:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:14,216 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:14,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:14,217 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:25:14,219 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:25:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:14,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:25:14,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:14,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 05:25:14,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 05:25:14,603 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:25:14,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:14,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-08-27 05:25:14,808 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:25:14,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:14,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331309395] [2021-08-27 05:25:14,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331309395] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:14,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:14,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 05:25:14,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453742470] [2021-08-27 05:25:14,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:14,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:14,810 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:15,006 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-08-27 05:25:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:15,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-08-27 05:25:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:15,008 INFO L225 Difference]: With dead ends: 69 [2021-08-27 05:25:15,008 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:25:15,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:25:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:25:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2021-08-27 05:25:15,011 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2021-08-27 05:25:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:15,011 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2021-08-27 05:25:15,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2021-08-27 05:25:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 05:25:15,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:15,012 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:15,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:25:15,219 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:25:15,219 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr8ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1035621474, now seen corresponding path program 1 times [2021-08-27 05:25:15,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:15,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465109425] [2021-08-27 05:25:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:15,221 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:15,230 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:25:15,232 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:25:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:15,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:25:15,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:15,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 05:25:15,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 05:25:15,638 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:25:15,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:15,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 05:25:15,856 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:25:15,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:15,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465109425] [2021-08-27 05:25:15,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465109425] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:15,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:15,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 05:25:15,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149490704] [2021-08-27 05:25:15,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:15,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:15,858 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:16,056 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-08-27 05:25:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 05:25:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:16,058 INFO L225 Difference]: With dead ends: 68 [2021-08-27 05:25:16,058 INFO L226 Difference]: Without dead ends: 68 [2021-08-27 05:25:16,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-27 05:25:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-27 05:25:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-08-27 05:25:16,060 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2021-08-27 05:25:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:16,060 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-08-27 05:25:16,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-08-27 05:25:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:25:16,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:16,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:16,073 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:25:16,261 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:25:16,262 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr9ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2039494522, now seen corresponding path program 1 times [2021-08-27 05:25:16,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:16,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116307434] [2021-08-27 05:25:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:16,263 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:16,264 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:25:16,265 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:25:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:16,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 05:25:16,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:16,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-08-27 05:25:16,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-08-27 05:25:16,845 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:25:16,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:17,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 05:25:17,154 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:25:17,154 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:17,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116307434] [2021-08-27 05:25:17,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116307434] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:17,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:17,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2021-08-27 05:25:17,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710957690] [2021-08-27 05:25:17,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:25:17,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:25:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:25:17,155 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:25:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:17,605 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-08-27 05:25:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 05:25:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2021-08-27 05:25:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:17,606 INFO L225 Difference]: With dead ends: 67 [2021-08-27 05:25:17,606 INFO L226 Difference]: Without dead ends: 67 [2021-08-27 05:25:17,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 190.4ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:25:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-27 05:25:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-08-27 05:25:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2021-08-27 05:25:17,609 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2021-08-27 05:25:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:17,609 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2021-08-27 05:25:17,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:25:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2021-08-27 05:25:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:25:17,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:17,610 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] [2021-08-27 05:25:17,621 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:25:17,817 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:25:17,818 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1217488631, now seen corresponding path program 1 times [2021-08-27 05:25:17,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:17,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263525373] [2021-08-27 05:25:17,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:17,819 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:17,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:17,821 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:25:17,822 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:25:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:18,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 05:25:18,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:18,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 05:25:18,291 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-08-27 05:25:18,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2021-08-27 05:25:18,404 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:18,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2021-08-27 05:25:18,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2021-08-27 05:25:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:18,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:18,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2021-08-27 05:25:18,871 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 05:25:18,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-08-27 05:25:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:18,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:18,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263525373] [2021-08-27 05:25:18,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263525373] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:25:18,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:25:18,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-08-27 05:25:18,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919581795] [2021-08-27 05:25:18,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:25:18,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:25:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:25:18,939 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:19,957 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-08-27 05:25:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:25:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-08-27 05:25:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:19,958 INFO L225 Difference]: With dead ends: 73 [2021-08-27 05:25:19,958 INFO L226 Difference]: Without dead ends: 73 [2021-08-27 05:25:19,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 550.5ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:25:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-27 05:25:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-08-27 05:25:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.346938775510204) internal successors, (66), 64 states have internal predecessors, (66), 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:25:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-08-27 05:25:19,961 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2021-08-27 05:25:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:19,961 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-08-27 05:25:19,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2021-08-27 05:25:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:25:19,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:19,962 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] [2021-08-27 05:25:19,971 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:25:20,169 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:25:20,170 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1217488630, now seen corresponding path program 1 times [2021-08-27 05:25:20,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:20,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148388944] [2021-08-27 05:25:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:20,171 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:20,179 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:25:20,179 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:25:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:20,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 05:25:20,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:20,589 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:25:20,604 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:25:20,774 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:25:20,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-08-27 05:25:20,787 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:25:20,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2021-08-27 05:25:20,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-08-27 05:25:20,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 05:25:21,160 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-08-27 05:25:21,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-08-27 05:25:21,361 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:21,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2021-08-27 05:25:21,386 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:21,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 47 [2021-08-27 05:25:21,594 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:25:21,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 51 [2021-08-27 05:25:21,601 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:25:21,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2021-08-27 05:25:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:21,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:22,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2021-08-27 05:25:22,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2021-08-27 05:25:23,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2021-08-27 05:25:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:28,815 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:28,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148388944] [2021-08-27 05:25:28,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148388944] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:25:28,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:25:28,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-08-27 05:25:28,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994657136] [2021-08-27 05:25:28,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:25:28,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:28,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:25:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=260, Unknown=2, NotChecked=0, Total=306 [2021-08-27 05:25:28,816 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 05:25:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:31,293 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2021-08-27 05:25:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:25:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 05:25:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:31,294 INFO L225 Difference]: With dead ends: 72 [2021-08-27 05:25:31,294 INFO L226 Difference]: Without dead ends: 72 [2021-08-27 05:25:31,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 6987.5ms TimeCoverageRelationStatistics Valid=149, Invalid=499, Unknown=2, NotChecked=0, Total=650 [2021-08-27 05:25:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-27 05:25:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-08-27 05:25:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 63 states have internal predecessors, (65), 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:25:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2021-08-27 05:25:31,296 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2021-08-27 05:25:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:31,296 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2021-08-27 05:25:31,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 05:25:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2021-08-27 05:25:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:25:31,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:31,298 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:31,308 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:25:31,499 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:25:31,499 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr10ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1200179360, now seen corresponding path program 1 times [2021-08-27 05:25:31,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:31,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732491828] [2021-08-27 05:25:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:31,500 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:31,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:31,501 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:25:31,502 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:25:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:31,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:25:31,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:32,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 05:25:32,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-08-27 05:25:32,085 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:25:32,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:32,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-27 05:25:32,339 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 05:25:32,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-08-27 05:25:32,416 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:25:32,416 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:32,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732491828] [2021-08-27 05:25:32,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732491828] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:32,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:32,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-08-27 05:25:32,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406937705] [2021-08-27 05:25:32,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:32,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:32,417 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:32,778 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-27 05:25:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-08-27 05:25:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:32,779 INFO L225 Difference]: With dead ends: 69 [2021-08-27 05:25:32,779 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:25:32,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 150.0ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:25:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:25:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:25:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 62 states have internal predecessors, (64), 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:25:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-08-27 05:25:32,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2021-08-27 05:25:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:32,781 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-08-27 05:25:32,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-08-27 05:25:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:25:32,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:32,781 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:32,794 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:25:32,982 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:25:32,982 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1449145399, now seen corresponding path program 1 times [2021-08-27 05:25:32,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:32,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907541291] [2021-08-27 05:25:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:32,982 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:32,983 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:25:32,984 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:25:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:33,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:25:33,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:33,405 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:25:33,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 05:25:33,581 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:25:33,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-08-27 05:25:33,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 05:25:33,700 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 05:25:33,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:25:33,735 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:25:33,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:33,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-08-27 05:25:33,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2021-08-27 05:25:33,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:25:33,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2021-08-27 05:25:34,198 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:25:34,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:34,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907541291] [2021-08-27 05:25:34,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907541291] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:34,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:34,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2021-08-27 05:25:34,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171528678] [2021-08-27 05:25:34,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:25:34,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:25:34,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:25:34,200 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:38,762 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-08-27 05:25:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:25:38,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-08-27 05:25:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:38,763 INFO L225 Difference]: With dead ends: 84 [2021-08-27 05:25:38,763 INFO L226 Difference]: Without dead ends: 84 [2021-08-27 05:25:38,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 294.6ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:25:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-27 05:25:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2021-08-27 05:25:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 61 states have internal predecessors, (63), 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:25:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-08-27 05:25:38,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2021-08-27 05:25:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:38,765 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-08-27 05:25:38,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-08-27 05:25:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:25:38,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:38,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:38,778 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:25:38,966 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:25:38,966 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1449145398, now seen corresponding path program 1 times [2021-08-27 05:25:38,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:38,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803653369] [2021-08-27 05:25:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:38,967 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:38,968 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:25:38,969 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:25:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:39,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:25:39,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:39,590 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:25:39,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:25:39,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-27 05:25:39,787 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:25:39,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:25:39,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803653369] [2021-08-27 05:25:39,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803653369] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:39,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:39,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-27 05:25:39,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465119626] [2021-08-27 05:25:39,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:39,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:25:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:39,789 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:39,959 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-08-27 05:25:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:25:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2021-08-27 05:25:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:39,960 INFO L225 Difference]: With dead ends: 63 [2021-08-27 05:25:39,960 INFO L226 Difference]: Without dead ends: 63 [2021-08-27 05:25:39,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-27 05:25:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-08-27 05:25:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.183673469387755) internal successors, (58), 56 states have internal predecessors, (58), 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:25:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-08-27 05:25:39,962 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2021-08-27 05:25:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:39,962 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-08-27 05:25:39,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2021-08-27 05:25:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 05:25:39,963 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:39,963 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:39,973 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:25:40,163 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:25:40,163 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr26ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 36 more)] === [2021-08-27 05:25:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -102022449, now seen corresponding path program 1 times [2021-08-27 05:25:40,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:25:40,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759730921] [2021-08-27 05:25:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:40,164 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:25:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:25:40,165 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:25:40,167 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:25:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:25:40,653 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:25:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:25:40,761 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 05:25:40,762 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:25:40,763 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr26ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 05:25:40,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 05:25:40,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION [2021-08-27 05:25:40,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION [2021-08-27 05:25:40,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION [2021-08-27 05:25:40,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION [2021-08-27 05:25:40,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-08-27 05:25:40,984 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:25:40,989 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:25:40,998 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:25:41,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:25:41 BoogieIcfgContainer [2021-08-27 05:25:41,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:25:41,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:25:41,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:25:41,025 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:25:41,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:24:54" (3/4) ... [2021-08-27 05:25:41,028 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:25:41,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:25:41,029 INFO L168 Benchmark]: Toolchain (without parser) took 46950.25 ms. Allocated memory was 62.9 MB in the beginning and 174.1 MB in the end (delta: 111.1 MB). Free memory was 42.4 MB in the beginning and 85.2 MB in the end (delta: -42.9 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:25:41,029 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 62.9 MB. Free memory was 45.1 MB in the beginning and 45.1 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:25:41,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.23 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 42.1 MB in the end (delta: 62.7 kB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:25:41,030 INFO L168 Benchmark]: Boogie Preprocessor took 36.20 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 39.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:25:41,030 INFO L168 Benchmark]: RCFGBuilder took 591.74 ms. Allocated memory was 62.9 MB in the beginning and 81.8 MB in the end (delta: 18.9 MB). Free memory was 39.0 MB in the beginning and 43.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:25:41,030 INFO L168 Benchmark]: TraceAbstraction took 46068.29 ms. Allocated memory was 81.8 MB in the beginning and 174.1 MB in the end (delta: 92.3 MB). Free memory was 43.3 MB in the beginning and 85.2 MB in the end (delta: -41.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:25:41,031 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 174.1 MB. Free memory is still 85.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:25:41,032 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 62.9 MB. Free memory was 45.1 MB in the beginning and 45.1 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 247.23 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 42.1 MB in the end (delta: 62.7 kB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.20 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 39.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 591.74 ms. Allocated memory was 62.9 MB in the beginning and 81.8 MB in the end (delta: 18.9 MB). Free memory was 39.0 MB in the beginning and 43.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 46068.29 ms. Allocated memory was 81.8 MB in the beginning and 174.1 MB in the end (delta: 92.3 MB). Free memory was 43.3 MB in the beginning and 85.2 MB in the end (delta: -41.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.14 ms. Allocated memory is still 174.1 MB. Free memory is still 85.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.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: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={31:0}] [L541] CALL append(&list) VAL [plist={31:0}] [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, plist={31:0}, plist={31:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, plist={31:0}, plist={31:0}] [L532] EXPR item->next VAL [item={1:0}, item->next={0:0}, plist={31:0}, plist={31:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={5:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={5:0}, plist={31:0}, plist={31:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={5:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={5:0}, plist={31:0}, plist={31:0}] [L535] *plist = item VAL [item={1:0}, plist={31:0}, plist={31:0}] [L541] RET append(&list) VAL [list={31:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={1:0}, list={31:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={1:0}, list={31:0}] [L544] EXPR list->next VAL [\read(*list)={1:0}, list={31:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={1:0}, list={31:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={31:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={31:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={31:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={31:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: 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: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 112 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 46002.9ms, OverallIterations: 17, TraceHistogramMax: 2, EmptinessCheckTime: 14.1ms, AutomataDifference: 22418.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 773 SDtfs, 852 SDslu, 2168 SDs, 0 SdLazy, 2359 SolverSat, 148 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 19565.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 524 SyntacticMatches, 12 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 9725.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 62.3ms AutomataMinimizationTime, 16 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 182.7ms SsaConstructionTime, 623.6ms SatisfiabilityAnalysisTime, 15455.4ms InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 47 QuantifiedInterpolants, 6231 SizeOfPredicates, 121 NumberOfNonLiveVariables, 2049 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 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:25:41,061 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...